EBOOK

The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

Jetzt
€ 539,99
Bisher € 569,99
 
gebunden
Lieferbar innert 2 Wochen
Januar 1991

Beschreibung

Beschreibung

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.

Inhaltsverzeichnis

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.
EAN: 9780471904137
ISBN: 0471904139
Untertitel: Sprache: Englisch.
Verlag: JOHN WILEY & SONS INC
Erscheinungsdatum: Januar 1991
Seitenanzahl: 476 Seiten
Format: gebunden
Es gibt zu diesem Artikel noch keine Bewertungen.Kundenbewertung schreiben