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.