ENGLISH

The Traveling Salesman Problem and Its Variations

By Abraham P. Punnen (auth.) , Gregory Gutin , Abraham P. Punnen (eds.)

Book information

Publisher
Springer US
Year
2007
ISBN
9781402006647, 1402006640
DOI
10.1007/b101971
LCC
QA164 .T733 2002
Open Library ID
OL21504913M
Language
english
Format
DJVU
Filesize
11 MB (11439187 bytes)
Series
Combinatorial Optimization 12
Edition
1
Pages
830\850
Time added
2014-10-05 02:30:00
Discrete Mathematics in Computer Science; Optimiza

Description

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 books