The Traveling Salesman Problem and Its Variations [electronic resource] / edited by Gregory Gutin, Abraham P. Punnen.
Contributor(s): Gutin, Gregory [editor.] | Punnen, Abraham P [editor.] | SpringerLink (Online service)Material type: TextSeries: Combinatorial Optimization: 12Publisher: Boston, MA : Springer US : Imprint: Springer, 2007Description: XVIII, 830 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9780306482137Subject(s): Computer science | Operations research | Decision making | Computer science -- Mathematics | Algorithms | Mathematical optimization | Computer Science | Discrete Mathematics in Computer Science | Optimization | Operation Research/Decision Theory | AlgorithmsAdditional physical formats: Printed edition:: No titleDDC classification: 004.0151 LOC classification: QA76.9.M35Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
The Traveling Salesman Problem: Applications, Formulations and Variations -- Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP -- Polyhedral Theory for the Asymmetric Traveling Salesman Problem -- Exact Methods for the Asymmetric Traveling Salesman Problem -- Approximation Algorithms for Geometric TSP -- Exponential Neighborhoods and Domination Analysis for the TSP -- Probabilistic Analysis of the TSP -- Local Search and Metaheuristics -- Experimental Analysis of Heuristics for the STSP -- Experimental Analysis of Heuristics for the ATSP -- Polynomially Solvable Cases of the TSP -- The Maximum TSP -- The Generalized Traveling Salesman and Orienteering Problems -- The Prize Collecting Traveling Salesman Problem and its Applications -- The Bottleneck TSP -- TSP Software.
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.