The Traveling Salesman Problem: A Case Study in Local Optimization

1995.

Cited by: 1496|Bibtex|Views41
Other Links: academic.microsoft.com

Abstract:

This is a preliminary version of a chapter that appeared in the book Local Search in Combinatorial Optimization, E. H. L. Aarts and J. K. Lenstra (eds.), John Wiley and Sons, London, 1997, pp. 215-310. The traveling salesman problem (TSP) has been an early proving ground for many approaches to combinatorial optimization, including clas- s...More

Code:

Data:

Your rating :
0

 

Tags
Comments