The Traveling Salesman Problem and Its Variations: 12 - Brossura

Brossura

ISBN 10: 0387444599 ISBN 13: 9780387444598

Casa editrice: Springer-Verlag GmbH, 2007

Riassunto

Written by reputable researchers, this book covers various important areas of study on Traveling Salesman Problem, 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, and more.

Su questo libro

Dalla quarta di copertina

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.

Dettagli dell'edizione

• Editore: Springer-Verlag GmbH
• Data di pubblicazione: 2007
• Lingua: Inglese
• ISBN 10: 0387444599
• ISBN 13: 9780387444598
• Rilegatura: Copertina flessibile
• Numero di pagine: 852
• Redattore: Gutin G., Punnen A. P.
• Contatto del produttore: ProductSafety@springernature.com; ProductSafety@springernature.com; ; Poststr. 9; Darmstadt; 64293; Germania