You are here

TheTraveling Salesman Problem: A Guided Tour of Combinatorial Optimization

E. L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys
Publisher: 
John Wiley
Publication Date: 
1991
Number of Pages: 
476
Format: 
Hardcover
Series: 
Wiley Series in Discrete Mathematics & Optimization
Price: 
315.00
ISBN: 
978-0471904137
Category: 
Monograph
BLL Rating: 

The Basic Library List Committee strongly recommends this book for acquisition by undergraduate mathematics libraries.

There is no review yet. Please check back later.

 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.

Dummy View - NOT TO BE DELETED