Abstract
We review the recent book authored by David L. Applegate, Robert E. Bixby, Vasěk Chvátal and William J. Cook, The traveling salesman problem: a computational study, Princeton Series in Applied Mathematics. Princeton University Press 2007, Hardback price $45.00 / £26.95, 606pp, ISBN 978-0-691-12993-8.
Similar content being viewed by others
References
(2002). The traveling salesman problem and its variations. Kluwer, Dordrecht
Junger M, Reinelt G and Rinaldi G (1995). The traveling salesman problem. In: Ball, M, Magnanti, T, Monma, C, and Nemhauser, G (eds) Network models. Handbooks in operations research and management science, vol 7, pp 225–330. Elsevier, Amsterdam
Junger M, Reinelt G and Rinaldi G (1997). The traveling salesman problem. In: Dell’Amico, M, Maffioli, F, and Martello, S (eds) Annotated bibliographies in combinatorial optimization, pp 199–221. Wiley, Chichester
(1985). The traveling salesman problem: a guided tour of combinatorial optimization. Wiley, Chichester
Naddef D (2002). Polyhedral theory and branch-and-cut algorithms for the symmetric TSP. In: Gutin, G and Punnen, A (eds) The traveling salesman problem and its variations, pp 29–116. Kluwer, Dordrecht
Reinelt G (1994). The traveling salesman: computational solutions for TSP applications. Lecture notes in computer science, vol 840. Springer, Berlin
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Letchford, A.N., Lodi, A. The traveling salesman problem: a book review. 4OR 5, 315–317 (2007). https://doi.org/10.1007/s10288-007-0058-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-007-0058-0