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.
- ISBN:
- 9780387444598
- 9780387444598
-
Category:
- Combinatorics & graph theory
- Format:
- Paperback
- Publication Date:
-
18-05-2007
- Language:
- English
- Publisher:
- Springer-Verlag New York Inc.
- Country of origin:
- United States
- Pages:
- 830
- Dimensions (mm):
- 235x155x42mm
- Weight:
- 1.28kg
This title is in stock with our Australian supplier and should arrive at our Sydney warehouse within 2 - 3 weeks of you placing an order.
Once received into our warehouse we will despatch it to you with a Shipping Notification which includes online tracking.
Please check the estimated delivery times below for your region, for after your order is despatched from our warehouse:
ACT Metro 2 working days
NSW Metro 2 working days
NSW Rural 2 - 3 working days
NSW Remote 2 - 5 working days
NT Metro 3 - 6 working days
NT Remote 4 - 10 working days
QLD Metro 2 - 4 working days
QLD Rural 2 - 5 working days
QLD Remote 2 - 7 working days
SA Metro 2 - 5 working days
SA Rural 3 - 6 working days
SA Remote 3 - 7 working days
TAS Metro 3 - 6 working days
TAS Rural 3 - 6 working days
VIC Metro 2 - 3 working days
VIC Rural 2 - 4 working days
VIC Remote 2 - 5 working days
WA Metro 3 - 6 working days
WA Rural 4 - 8 working days
WA Remote 4 - 12 working days
Share This Book: