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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
