The Traveling Salesman Problem: A Guided Tour of Combinatorial OptimizationISBN: 978-0-471-90413-7
Hardcover
476 pages
January 1991
 This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 10-15 days delivery time. The book is not returnable.
|
||||||
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.
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.
Related Titles
More By These Authors
Discrete Mathematics
.png){kind=small}
Join An E-mail ListLearn about the latest products, events, offers and content. |
