Overview
- Provides the state of the art in theory and algorithms for the traveling salesman problem (TSP)
- Written by reputable researchers, covering all important areas of study on TSP
- Intended for researchers, practitioners, and academicians in mathematics, computer science, and operations research
- Appropriate as a reference work or as a main or supplemental textbook in graduate and senior undergraduate courses and projects
Part of the book series: Combinatorial Optimization (COOP, volume 12)
Buy print copy
About this book
This volume, which contains chapters written by reputable researchers, provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, thorough computational analysis of heuristic and metaheuristic algorithms, theoretical analysis of approximation algorithms, including the emerging area of domination analysis of algorithms, discussion of TSP software and variations of TSP such as bottleneck TSP, generalized TSP, prize collecting TSP, maximizing TSP, orienteering problem, etc.
Audience
This book is intended for researchers, practitioners, and academicians in mathematics, computer science, and operations research. It is appropriate as a reference work or as a main or supplemental textbook in graduate and senior undergraduate courses and projects.
Similar content being viewed by others
Keywords
Table of contents (16 chapters)
Editors and Affiliations
Bibliographic Information
Book Title: The Traveling Salesman Problem and Its Variations
Editors: Gregory Gutin, Abraham P. Punnen
Series Title: Combinatorial Optimization
DOI: https://doi.org/10.1007/b101971
Publisher: Springer New York, NY
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer-Verlag US 2007
Hardcover ISBN: 978-1-4020-0664-7Published: 31 May 2002
Softcover ISBN: 978-0-387-44459-8Published: 18 May 2007
eBook ISBN: 978-0-306-48213-7Published: 02 May 2006
Series ISSN: 1388-3011
Edition Number: 1
Number of Pages: XVIII, 830
Topics: Discrete Mathematics in Computer Science, Optimization, Operations Research/Decision Theory, Algorithms