The traveling salesman problem : a guided tour of combinatorial optimization [texte imprimé] /
Lawler E.L., Éditeur scientifique ;
Lenstra J.K., Éditeur scientifique . -
New York : John Wiley & Sons, 1985 . - X-465 p. : ill. ; 25 cm.. - (
Wiley-interscience series in discrete mathematics and optimization) .
ISBN : 978-0-471-90413-7
Bibliogr. p. 449-465. Index
Langues : Anglais (
eng)
| Mots-clés : |
Problème du voyageur de commerce
Analyse combinatoire
Optimisation combinatoire
Voyageurs de commerce
Combinatorial optimization
Traveling-salesman problem |
| Index. décimale : |
519.1 Analyse combinatoire. Théorie des graphies |
| Résumé : |
The traveling salesman problem is central to the area of combinatorial optimization, and it is through this problem that many of the most important developments in the area have been made. This book focusses on essential ideas; through them it illustrates all the concepts and techniques of combinatorial optimization concisely but comprehensively. The extensive reference list and numerous exercices direct the reader towards related fields and give results. |
| Note de contenu : |
Au sommaire :
- History
- Motivation and modeling
- Computational complexity
- Well-solved special cases
- Performance guarantees for heuristics
- Probabilistic analysis of heuristics
- Empirical analysis of heuristics
- Polyhedrat theory
- Polyhedrat computations
- Branch and nound methods
- Hamiltonian cycles
- Vehicle routing |
The traveling salesman problem (1985)
