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 prerequi...

Full description

Bibliographic Details
Main Author:	Reinelt, G. (Gerhard)
Corporate Author:	SpringerLink (Online service)
Format:	eBook
Language:	English
Published:	Berlin ; New York : Springer-Verlag, [1994]
Series:	Lecture notes in computer science ; 840.
Subjects:	Traveling salesman problem. Heuristic programming. Algorithms. voyageur commerce. Algorithmes. Problèmes de tournées. Programmation heuristique. Handelsreizigersprobleem. Problème du voyageur de commerce. Electronic books. Electronic resources (Books)
Online Access:	Connect to the full text of this electronic book

Table of Contents:

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.