https://blog.csdn.net/master_hunterzh-cnhttps://blog.csdn.net/https://blog.csdn.net/master_hunter/article/details/168744351https://blog.csdn.net/master_hunter/article/details/168744351master_hunterThu, 22 Oct 2026 10:03:32 +0800https://blog.csdn.net/master_hunter/article/details/167368666https://blog.csdn.net/master_hunter/article/details/167368666master_hunterFri, 09 Oct 2026 10:31:04 +0800https://blog.csdn.net/master_hunter/article/details/166791137https://blog.csdn.net/master_hunter/article/details/166791137master_hunterMon, 28 Sep 2026 17:07:50 +0800https://blog.csdn.net/master_hunter/article/details/165745982https://blog.csdn.net/master_hunter/article/details/165745982master_hunterThu, 17 Sep 2026 15:05:46 +0800https://blog.csdn.net/master_hunter/article/details/164012717https://blog.csdn.net/master_hunter/article/details/164012717master_hunterMon, 24 Aug 2026 09:02:52 +0800https://blog.csdn.net/master_hunter/article/details/163707266https://blog.csdn.net/master_hunter/article/details/163707266master_hunterWed, 12 Aug 2026 23:31:04 +0800https://blog.csdn.net/master_hunter/article/details/163170247https://blog.csdn.net/master_hunter/article/details/163170247master_hunterFri, 24 Jul 2026 18:54:40 +0800https://blog.csdn.net/master_hunter/article/details/162736490https://blog.csdn.net/master_hunter/article/details/162736490master_hunterThu, 09 Jul 2026 17:56:26 +0800https://blog.csdn.net/master_hunter/article/details/162429539https://blog.csdn.net/master_hunter/article/details/162429539master_hunterMon, 29 Jun 2026 19:37:26 +0800https://blog.csdn.net/master_hunter/article/details/162087985https://blog.csdn.net/master_hunter/article/details/162087985master_hunterThu, 18 Jun 2026 09:23:31 +0800https://blog.csdn.net/master_hunter/article/details/161720782https://blog.csdn.net/master_hunter/article/details/161720782master_hunterFri, 05 Jun 2026 14:46:15 +0800https://blog.csdn.net/master_hunter/article/details/161648406https://blog.csdn.net/master_hunter/article/details/161648406master_hunterWed, 03 Jun 2026 11:06:28 +0800https://blog.csdn.net/master_hunter/article/details/161425249https://blog.csdn.net/master_hunter/article/details/161425249master_hunterTue, 26 May 2026 15:49:02 +0800https://blog.csdn.net/master_hunter/article/details/161248482https://blog.csdn.net/master_hunter/article/details/161248482master_hunterWed, 20 May 2026 11:06:29 +0800https://blog.csdn.net/master_hunter/article/details/161207528https://blog.csdn.net/master_hunter/article/details/161207528master_hunterTue, 19 May 2026 08:45:44 +0800https://blog.csdn.net/master_hunter/article/details/160407818https://blog.csdn.net/master_hunter/article/details/160407818master_hunterWed, 22 Apr 2026 14:19:48 +0800https://blog.csdn.net/master_hunter/article/details/160171284https://blog.csdn.net/master_hunter/article/details/160171284master_hunterWed, 15 Apr 2026 10:42:35 +0800https://blog.csdn.net/master_hunter/article/details/159730828https://blog.csdn.net/master_hunter/article/details/159730828master_hunterWed, 01 Apr 2026 16:06:07 +0800https://blog.csdn.net/master_hunter/article/details/157936597https://blog.csdn.net/master_hunter/article/details/157936597master_hunterTue, 10 Feb 2026 10:59:57 +0800https://blog.csdn.net/master_hunter/article/details/157774146https://blog.csdn.net/master_hunter/article/details/157774146master_hunterThu, 05 Feb 2026 19:36:53 +0800 真正让我们愿意信任 AI 的，是在赛题刚发布时，它比我们更冷静。 我们参加的是 2023 年 MCM 比赛，当时拿到的题目是关于**多地点服务设施的最优选址问题**（E 题）。刚看完题目的时候，我们脑子里全是关键词： - 多目标优化？NP 难问题？ - 该不该建模成线性规划？还是遗传算法？ - 这是不是那个 Facility Location Problem 的改版？ 但是经验告诉我们，一旦直接跳模型，很容易走题。我们决定先停下来，让 AI 帮我们**“反向解构题目”**：]]>