Del 12 i serien Wiley Series in Discrete Mathematics & Optimization

Traveling Salesman Problem

A Guided Tour of Combinatorial Optimization

Inbunden, Engelska, 1985

AvE. L. Lawler,Jan Karel Lenstra,A. H. G. Rinnooy Kan,D. B. Shmoys

6 969 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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

Utgivningsdatum1985-08-28
Mått170 x 247 x 32 mm
Vikt879 g
FormatInbunden
SpråkEngelska
SerieWiley Series in Discrete Mathematics & Optimization
Antal sidor476
FörlagJohn Wiley & Sons Inc
ISBN9780471904137

Tillhör följande kategorier

Matematikens grunder inom Naturvetenskap och teknik

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.