The Traveling Salesman Problem A Guided Tour

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.

Eugene Leighton Lawler was an American computer scientist, a professor of computer science at the University of California, Berkeley. Jan Karel Lenstra is the author of The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, published by Wiley.

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.

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

FREE SHIPPING

Rent More, Save More! Use code: BBRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

The Traveling Salesman Problem A Guided Tour of Combinatorial Optimization

Summary

Author Biography

Table of Contents

Supplemental Materials