The Traveling Salesman Problem and Its Variations (Combinatorial Optimization) Book + PRICE WATCH * Amazon pricing is not included in price watch

The Traveling Salesman Problem and Its Variations (Combinatorial Optimization) Book

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.Read More

from£N/A | RRP: £66.99
* Excludes Voucher Code Discount Also available Used from £N/A
  • 0387444599
  • 9780387444598
  • 22 May 2007
  • Springer
  • Paperback (Book)
  • 830
  • New edition
As an Amazon Associate we earn from qualifying purchases. If you click through any of the links below and make a purchase we may earn a small commission (at no extra cost to you). Click here to learn more.

Would you like your name to appear with the review?

We will post your book review within a day or so as long as it meets our guidelines and terms and conditions. All reviews submitted become the licensed property of www.find-book.co.uk as written in our terms and conditions. None of your personal details will be passed on to any other third party.

All form fields are required.