Title: The Traveling salesman problem :
Authors: Lawler, Eugene L.
Date: 1985
Publisher: Wiley,
Physical description: x, 465 pages : illustrations ; 25 cm.
Language: English
LC classification: Q
Abstract: 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.
Contents: History / A.J. Hoffman, P. Wolfe -- Motivation and modeling / R.S. Garfinkel -- Computational complexity / D.S. Johnson, C.H. Papadimitriou -- Well-solved special cases / P.C. Gilmore, E.L. Lawler, D.B. Shmoys -- Performance guarantees for heuristics / D.S. Johnson, C.H. Papadimitriou -- Probabilistic analysis of heuristics / R.M. Karp, J.M. Steele -- Empirical analysis of heuristics / B.L. Golden, W.R. Stewart -- Polyhedral theory / M. Grötschel, M.W. Padberg -- Polyhedral computations / M.W. Padberg, M. Grötschel -- Branch and bound methods / E. Balas, P. Toth -- Hamiltonian cycles / V. Chvátal -- Vehicle routing / N. Christofides.
Notes: "A Wiley-Interscience publication." Includes index.
Subject headings (LCSH): Combinatorial optimization.; Traveling salesman problem.; Traveling-salesman problem.