 |
|
|
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization |
| Wiley Series in Discrete Mathematics & Optimization |
| E. L. Lawler (Univ. of California, Berkeley); Jan Karel Lenstra (Centre for Mathematics and Computer Science, The Netherlands); A. H. G. Rinnooy Kan (Erasmus Univ., Rotterdam); D. B. Shmoys (Harvard Univ.) |
| 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.
|
|
| Cloth Bound |
476 Pages,
|
Item #:
Price: |
0471904139
$390.00 |
John Wiley & Sons, Inc. | |
|
|
|
|
