4 ms·
LKH: the current best-known heuristic for solving large-scale TSP instances
- deleted 17y ago[deleted]
- zitterbewegung 17y agoNo, this is only an approximation of the TSP. (Edit: parent post sort of got me thinking about if we could practically resolve P?NP to P=NP and the implications of that although it would be much like P=NP.)