Hacker Newsnew | past | comments | ask | show | jobs | submitlogin
LKH: the current best-known heuristic for solving large-scale TSP instances (ruc.dk)
21 points by henning on Nov 1, 2009 | hide | past | favorite | 1 comment


[deleted]


No, 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.)




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: