Traveling Salesman Problem

A Guided Tour of Combinatorial Optimization

AvE. L. Lawler,Jan Karel Lenstra

Inbunden, Engelska, 1985

Del 12 i serien Wiley Series in Discrete Mathematics & Optimization

5 197 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:1985-08-28
Mått:170 x 247 x 32 mm
Vikt:879 g
Format:Inbunden
Språk:Engelska
Serie:Wiley Series in Discrete Mathematics & Optimization
Antal sidor:476
Förlag:John Wiley & Sons Inc
ISBN:9780471904137

Utforska kategorier

Matematikens grunder inom Naturvetenskap och teknik

Mer om författaren

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.

Innehållsförteckning

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.