Items related to The Traveling Salesman Problem and Its Variations (Combinato...
A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and 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, and includes a thorough computational analysis of heuristic and metaheuristic algorithms.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
- PublisherSpringer
- Publication date2007
- ISBN 10 0387444599
- ISBN 13 9780387444598
- BindingPaperback
- Number of pages848
- EditorGutin G., Punnen A.P.
Buy New
Learn more about this copy
US$ 319.30
Shipping:
FREE
Within U.S.A.
Top Search Results from the AbeBooks Marketplace
Seller Image
The Traveling Salesman Problem and Its Variations (Combinatorial Optimization) [Paperback ]
Seller:
Rating
Book Description Soft Cover. Condition: new. Seller Inventory # 9780387444598
Buy New
US$ 319.30
Convert currency
Seller Image
The Traveling Salesman Problem and Its Variations
Published by
Springer US
(2007)
ISBN 10: 0387444599
ISBN 13: 9780387444598
New
Softcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Provides the state of the art in theory and algorithms for the traveling salesman problem (TSP)Written by reputable researchers, covering all important areas of study on TSPIntended for researchers, practitioners, and academicians in mathem. Seller Inventory # 5910345
Buy New
US$ 295.16
Convert currency
Stock Image
The Traveling Salesman Problem and Its Variations
Published by
Springer
(2007)
ISBN 10: 0387444599
ISBN 13: 9780387444598
New
Softcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9780387444598_lsuk
Buy New
US$ 335.18
Convert currency
Stock Image
The Traveling Salesman Problem and Its Variations (Combinatorial Optimization, 12)
Published by
Springer
(2007)
ISBN 10: 0387444599
ISBN 13: 9780387444598
New
Softcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. Seller Inventory # ABLIING23Feb2215580172324
Buy New
US$ 344.76
Convert currency
Seller Image
The Traveling Salesman Problem and Its Variations
Published by
Springer US Mai 2007
(2007)
ISBN 10: 0387444599
ISBN 13: 9780387444598
New
Taschenbuch
Quantity: 2
Seller:
Rating
Book Description Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and 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, and includes a thorough computational analysis of heuristic and metaheuristic algorithms. 852 pp. Englisch. Seller Inventory # 9780387444598
Buy New
US$ 353.70
Convert currency
Seller Image
The Traveling Salesman Problem and Its Variations
Published by
Springer US
(2007)
ISBN 10: 0387444599
ISBN 13: 9780387444598
New
Taschenbuch
Quantity: 1
Seller:
Rating
Book Description Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. AudienceThis 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. Seller Inventory # 9780387444598
Buy New
US$ 357.95
Convert currency
Stock Image
The Traveling Salesman Problem and Its Variations
Published by
Springer Verlag
(2007)
ISBN 10: 0387444599
ISBN 13: 9780387444598
New
Paperback
Quantity: 2
Seller:
Rating
Book Description Paperback. Condition: Brand New. 1st edition. 830 pages. 9.00x6.25x1.75 inches. In Stock. Seller Inventory # x-0387444599
Buy New
US$ 438.75
Convert currency