Items related to The Traveling Salesman Problem and Its Variations:...

The Traveling Salesman Problem and Its Variations: 12 (Combinatorial Optimization, 12) - Hardcover

 
9781402006647: The Traveling Salesman Problem and Its Variations: 12 (Combinatorial Optimization, 12)
Hardcover
ISBN 10: 1402006640 ISBN 13: 9781402006647
Publisher: Springer, 2002

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.

"synopsis" may belong to another edition of this title.

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.

"About this title" may belong to another edition of this title.

Publisher
Springer
Publication date
2002
Language
English
ISBN 10 
1402006640
ISBN 13 
9781402006647
Binding
Hardcover
Number of pages
848
Editor
Gutin G., Punnen A.P.