The following pages link to Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem (Q3730367):
Displayed 1 item.