Image from Syndetics
Text| Item type | Current library | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
| Standard Loan | Thurles Library Main Collection | 511.6 LAW (Browse shelf(Opens below)) | Available | R12602KRCT |
Enhanced descriptions from Syndetics:
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 provided by Syndetics
- History
- Motivation and Modeling
- Computational Complexity
- Well-Solved Special Cases
- Performance Guarantees for Heuristics
- Probabilistic Analysis of Heuristics
- Empirical Analysis of Heuristics
- Polyhedral Theory
- Polyhedral Algorithms
- Branch and Bound Methods
- Hamiltonian Cycles
- Vehicle Routing
- Bibliography
Author notes provided by Syndetics
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.