Non-Fiction Books:

The Traveling Salesman Problem and Its Variations

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Format:

Paperback / softback
$792.99
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks

Buy Now, Pay Later with:

4 payments of $198.25 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 13-25 June using International Courier

Description

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.
Release date Australia
May 18th, 2007
Audiences
  • Postgraduate, Research & Scholarly
  • Undergraduate
Contributors
  • Edited by A P Punnen
  • Edited by G Gutin
Illustrations
XVIII, 830 p.
Pages
830
Dimensions
156x234x42
ISBN-13
9780387444598
Product ID
2435125

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

Filed under...