The Traveling Salesman Problem and Its Variations

The Traveling Salesman Problem and Its Variations

4.11 - 1251 ratings - Source

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.The algorithm that Gilmore and Gomory developed for the problem is however more efficient and it is also non-trivial with a fairly ... The problem is to decide the order in which the jobs should be treated in the furnace so as to minimizeanbsp;...

Title:The Traveling Salesman Problem and Its Variations
Author: G. Gutin, A.P. Punnen
Publisher:Springer Science & Business Media - 2006-05-02

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

How it works:
  • 1. Register a free 1 month Trial Account.
  • 2. Download as many books as you like (Personal use)
  • 3. Cancel the membership at any time if not satisfied.

Click button below to register and download Ebook
Privacy Policy | Contact | DMCA