The following pages link to (Q3039069):
Displayed 4 items.
- A useful transform of standard input data for a classical NP-complete problem (Q1058470) (← links)
- On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem (Q1078097) (← links)
- An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
- On the refinement of bounds of heuristic algorithms for the traveling salesman problem (Q3678965) (← links)