The Traveling Salesman Problem and Its Variations (2002) (Combinatorial Optimization #12)
By: and
Sign Up Now!
Already a Member? Log In
You must be logged into UK education collection to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 2007
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9780306482137
- Related ISBNs:
- 9781402006647
- Publisher:
- Springer US
- Date of Addition:
- 12/09/20
- Copyrighted By:
- N/A
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Computers and Internet, Business and Finance, Mathematics and Statistics
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.
- Edited by:
- G. Gutin
- Edited by:
- A.P. Punnen
Reviews
Other Books
- by G. Gutin
- by A. P. Punnen
- in Nonfiction
- in Computers and Internet
- in Business and Finance
- in Mathematics and Statistics