The traveling salesman: computational solutions for TSP applications
This book is devoted to the famous traveling salesman problem (TSP), which is the task of finding a route of shortest possible length through a given set of cities. The TSP attracts interest from several scientific communities and from numerous application areas. First the theoretical prerequisites...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book/Monograph |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer-Verlag Berlin Heidelberg
1994
|
| Series: | Lecture notes in computer science
840 |
| In: |
Lecture notes in computer science (840)
|
| DOI: | 10.1007/3-540-48661-5 |
| Subjects: | |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1007/3-540-48661-5 Resolving-System, lizenzpflichtig, Volltext: http://dx.doi.org/10.1007/3-540-48661-5 Cover: https://swbplus.bsz-bw.de/bsz322907187cov.jpg Inhaltsverzeichnis: https://swbplus.bsz-bw.de/bsz041022238inh.htm Verlag, Zentralblatt MATH, Inhaltstext: https://zbmath.org/?q=an:0825.90720 
|
| Author Notes: | by Gerhard Reinelt |
| Summary: | This book is devoted to the famous traveling salesman problem (TSP), which is the task of finding a route of shortest possible length through a given set of cities. The TSP attracts interest from several scientific communities and from numerous application areas. First the theoretical prerequisites are summarized. Then the emphasis shifts to computational solutions for practical TSP applications. Detailed computational experiments are used to show how to find good or acceptable routes for large problem instances in reasonable time. In total, this book meets a tremendous professional need for effective algorithms; it is the most comprehensive and up-to-date survey available on heuristic approaches to TSP solving |
|---|---|
| Item Description: | Literaturverz. S. [214] - 221 |
| Physical Description: | Online Resource |
| ISBN: | 9783540486619 |
| DOI: | 10.1007/3-540-48661-5 |