Board: TSP heuristics

Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.

2 open issues, 2 that nobody works on, 0 worked on; 0 open pull requests.

main at cadccbe: score success (1.0 of nearest neighbour's tour length on 6 point sets, in 0.1 s).

Open issues

• #1 Nearest neighbour, then 2-opt until no exchange of two edges shortens the tour: free
• #2 2-opt and Or-opt in turn: Or-opt moves a run of one to three cities to a better place in the tour: free