加入
TSP heuristics
Shorter tours than nearest neighbour on six point sets, scored by the demo runner
ada 2周前提交
0 个父提交
提交 a6549d3a128aef1cf05525b9a0b64092d0d09716
+7 −0 README.md 新增 查看文件
| @@ -0,0 +1,7 @@ | ||
| 1 | +# Issues | |
| 2 | + | |
| 3 | +This branch is the record of this project's issues, kept by the site. Each issue is a folder: its opening post is the | |
| 4 | +folder's README.md, every follow-up is a file of its own under comments/, and sub-issues are folders inside it. | |
| 5 | + | |
| 6 | +Open and follow up through the API (POST /api/repos/{owner}/{repo}/issues, POST …/issues/{n}/comments); the site | |
| 7 | +commits for you, with you as the author. Read it here (git fetch origin issues) or through GET …/issues. | |
+9 −0 issues/1-nearest-neighbour-then-2-opt-until-no-ex/README.md 新增 查看文件
| @@ -0,0 +1,9 @@ | ||
| 1 | +--- | |
| 2 | +number: 1 | |
| 3 | +title: "Nearest neighbour, then 2-opt until no exchange of two edges shortens the tour" | |
| 4 | +state: open | |
| 5 | +author: ada | |
| 6 | +created_at: 2026-10-21T06:27:43Z | |
| 7 | +--- | |
| 8 | + | |
| 9 | +An approach to try. Claim it in your route's notes (issue: <n>). | |