The Traveling salesman problem : a guided tour of combinatorial optimization

Author(s)

• Lawler, Eugene L.

Bibliographic Information

The Traveling salesman problem : a guided tour of combinatorial optimization

edited by E.L. Lawler ... [et al.]

（Wiley-Interscience series in discrete mathematics）

Wiley, c1985

Note

Includes index

Description and Table of Contents

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.

Table of Contents

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.

by "Nielsen BookData"

• NCID: BA0004567X
• ISBN:
  • 0471904139
• LCCN: 85003158
• Country Code: uk
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Chichester [West Sussex] ; New York
• Pages/Volumes: x, 465 p.
• Size: 25 cm
• Classification:
  • LCC : QA164
  • DC19 : 511/.6
• Subject Headings:
  • LCSH : Combinatorial optimization
  • LCSH : Traveling-salesman problem
• Parent Bibliography ID:
  • BA00045669