The Traveling Salesman Problem and Its Variations

Gutin, G. (Edited by)/ Punnen, A.P. (Edited by)

ISBN 10: 1402006640 / ISBN 13: 9781402006647

Published by Springer, 2002

About this Item

830 pages. 9.50x6.50x1.75 inches. In Stock.

Seller Inventory # x-1402006640

Bibliographic Details

• Title: The Traveling Salesman Problem and Its Variations
• Publisher: Springer
• Publication Date: 2002
• Language: English
• ISBN 10: 1402006640
• ISBN 13: 9781402006647
• Binding: Hardcover
• Condition: Brand New
• Weight: 1.42 kilograms

About this title

Synopsis

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. 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.

From the Back Cover

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.