next up previous
Next: About this document ... Up: TSP Algorithms in Action Previous: 4. Lower Bounds

Bibliography

1
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan, and D.B. Shmoys, editors.
The Traveling Salesman Problem.
Wiley-Interscience series in discrete mathematics and optimization. John Wiley & Sons, New York, 1985.

2
Gerhard Reinelt.
The Travelling Salesman. Computational Solutions for TSP Applications, volume 840 of Lecture Notes in Computer Science.
Springer-Verlag, Berlin Heidelberg New York, 1994.



Stephan Mertens
1999-05-10