Skip to main content

The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

Hardcover

$577.25

The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

E. L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys

ISBN: 978-0-471-90413-7 January 1991 476 Pages

Download Product Flyer

Download Product Flyer

Download Product Flyer is to download PDF in new tab. This is a dummy description. Download Product Flyer is to download PDF in new tab. This is a dummy description. Download Product Flyer is to download PDF in new tab. This is a dummy description. Download Product Flyer is to download PDF in new tab. This is a dummy description.

Description

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.
History (A. Hoffman and P. Wolfe).
Motivation and Modeling (R. Garfinkel).
Computational Complexity (D. Johnson and C. Papadimitriou).
Well-Solved Special Cases (P. Gilmore, et al.).
Performance Guarantees for Heuristics (D. Johnson and C.Papadimitriou).
Probabilistic Analysis of Heuristics (R. Karp and J. Steele).
Empirical Analysis of Heuristics (B. Golden and W. Stewart).
Polyhedral Theory (M. Grotschel and M. Padberg).
Polyhedral Algorithms (M. Padberg and M. Grotschel).
Branch and Bound Methods (E. Balas and P. Toth).
Hamiltonian Cycles (V. Chvatal).
Vehicle Routing (N. Christofides).
Bibliography.