The Traveling Salesman

N/ACitations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

"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."--PUBLISHER'S WEBSITE. 1. Introduction -- 2. Basic Concepts -- 3. Related Problems and Applications -- 4. Geometric Concepts -- 5. Candidate Sets -- 6. Construction Heuristics -- 7. Improving Solutions -- 8. Heuristics for Large Geometric Problems -- 9. Further Heuristic Approaches -- 10. Lower Bounds -- 11. A Case Study: TSPs in PCB Production -- 12. Practical TSP Solving -- Appendix: TSPLIB.

Cite

CITATION STYLE

APA

The Traveling Salesman. (1994). The Traveling Salesman. Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-48661-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free