Ebook: The Traveling Salesman Problem and Its Variations

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.

---

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.

---

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.

Content:
Front Matter....Pages i-xviii
The Traveling Salesman Problem: Applications, Formulations and Variations....Pages 1-28
Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP....Pages 29-116
Polyhedral Theory for the Asymmetric Traveling Salesman Problem....Pages 117-168
Exact Methods for the Asymmetric Traveling Salesman Problem....Pages 169-205
Approximation Algorithms for Geometric TSP....Pages 207-221
Exponential Neighborhoods and Domination Analysis for the TSP....Pages 223-256
Probabilistic Analysis of the TSP....Pages 257-307
Local Search and Metaheuristics....Pages 309-368
Experimental Analysis of Heuristics for the STSP....Pages 369-443
Experimental Analysis of Heuristics for the ATSP....Pages 445-487
Polynomially Solvable Cases of the TSP....Pages 489-583
The Maximum TSP....Pages 585-607
The Generalized Traveling Salesman and Orienteering Problems....Pages 609-662
The Prize Collecting Traveling Salesman Problem and Its Applications....Pages 663-695
The Bottleneck TSP....Pages 697-735
TSP Software....Pages 737-749
Back Matter....Pages 750-830

---

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.

Content:
Front Matter....Pages i-xviii
The Traveling Salesman Problem: Applications, Formulations and Variations....Pages 1-28
Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP....Pages 29-116
Polyhedral Theory for the Asymmetric Traveling Salesman Problem....Pages 117-168
Exact Methods for the Asymmetric Traveling Salesman Problem....Pages 169-205
Approximation Algorithms for Geometric TSP....Pages 207-221
Exponential Neighborhoods and Domination Analysis for the TSP....Pages 223-256
Probabilistic Analysis of the TSP....Pages 257-307
Local Search and Metaheuristics....Pages 309-368
Experimental Analysis of Heuristics for the STSP....Pages 369-443
Experimental Analysis of Heuristics for the ATSP....Pages 445-487
Polynomially Solvable Cases of the TSP....Pages 489-583
The Maximum TSP....Pages 585-607
The Generalized Traveling Salesman and Orienteering Problems....Pages 609-662
The Prize Collecting Traveling Salesman Problem and Its Applications....Pages 663-695
The Bottleneck TSP....Pages 697-735
TSP Software....Pages 737-749
Back Matter....Pages 750-830
....