The Traveling Salesman Problem and Its Variations: 12 2007th Edition

The Traveling Salesman Problem and Its Variations: 12 2007th Edition book cover

The Traveling Salesman Problem and Its Variations: 12 2007th Edition

Author(s): G. Gutin (Editor), A.P. Punnen

  • Publisher: Springer
  • Publication Date: 31 May 2002
  • Edition: 2007th
  • Language: English
  • Print length: 848 pages
  • ISBN-10: 1402006640
  • ISBN-13: 9781402006647

Book 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. 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.

Editorial Reviews

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.

View on Amazon

电子书代发PDF格式价格30我要求助
未经允许不得转载:Wow! eBook » The Traveling Salesman Problem and Its Variations: 12 2007th Edition