The traveling salesman problem : a guided tour of combinatorial optimization
edited by E.L. Lawler ... [et al.].
Chichester [West Sussex] ; New York : Wiley, ©1985.
x, 465 págs. : ilustraciones ; 25 cm.
Serie: Wiley-Interscience series in discrete mathematics
ISBN: 0471904139
"A Wiley-Interscience publication."
Incluye índice.
Bibliografía: p. 449-465.
Reseña: MathSciNet, 87f:90057
Contenido
- A. J. Hoffman and P. Wolfe [Philip Wolfe], History
- R. S. Garfinkel, Motivation and modeling
- D. S. Johnson [David Stifler Johnson] and C. H. Papadimitriou, Computational complexity
- P. C. Gilmore, E. L. Lawler and D. B. Shmoys, Well-solved special cases
- D. S. Johnson [David Stifler Johnson] and C. H. Papadimitriou, Performance guarantees for heuristics
- R. M. Karp and J. M. Steele, Probabilistic analysis of heuristics
- B. L. Golden and W. R. Stewart, Empirical analysis of heuristics
- M. Grötschel and M. W. Padberg, Polyhedral theory
- M. W. Padberg and M. Grötschel, Polyhedral computations
- E. Balas [Egon Balas] and P. Toth [Paolo Toth], Branch and bound methods
- V. Chv\' atal, Hamiltonian cycles
- N. Christofides, Vehicle routing.
- 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).