The Traveling Salesman Problem and Its Variations

G. Gutin (u. a.)

ISBN 10: 0387444599 / ISBN 13: 9780387444598

Published by Springer, 2007

About this Item

The Traveling Salesman Problem and Its Variations | G. Gutin (u. a.) | Taschenbuch | Combinatorial Optimization | xviii | Englisch | 2007 | Springer | EAN 9780387444598 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Seller Inventory # 102046504

Bibliographic Details

• Title: The Traveling Salesman Problem and Its Variations
• Publisher: Springer
• Publication Date: 2007
• Language: English
• ISBN 10: 0387444599
• ISBN 13: 9780387444598
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 46D millimeters 235 millimeters width by 155 millimeters height by 46 millimeters depth
• Weight: 1264 grams
• Seller catalogs:
  • Bücher

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.