June 21st Father's Day! All the best gift ideas. Shop NowJune 21st Father's Day! All the best gift ideas. Shop Now
Add Item to wish listAdd Item to wish list

The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

By E. L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys
Hardcover
$602.95
By E. L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys
Promotion message icon
Premium Members save an extra 10% and all Members collect stamps to save with Rewards. 10 stamps = $5.Learn More
Formats
In stock
This item is currently out of stock online.
Free standard shipping on orders over $60
Select a store to view item availability.
Provides an in-depth treatment of the Traveling Salesman problem—the archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a self-contained manner. Includes exercises and an extensive bibliography.

Categories

Science & TechnologyEngineeringMathematicsEngineering - General & MiscellaneousFun & Educational MathComputer Science & CombinatoricsMathematics - Problems & ExercisesMathematical Programming & Operations ResearchCombinatorial optimization