ENGLISH

The Traveling Salesman. Computational Solutions fpr TSP Applications: Computational Solutions for TSP Applications

By Gerhard Reinelt

Book information

Publisher
Springer
Year
1994
ISBN
3540583343, 9783540583349
DOI
10.1016/S1534-0856
LCC
T57.78 .R47 1994
Open Library ID
OL1106356M
Language
english
Format
DJVU
Filesize
2 MB (1723217 bytes)
Series
Lecture Notes in Computer Science 0840
Pages
230\230
Library
Kolxo3
DPI
300
Time added
2011-01-06 10:13:16

Description

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.

Similar books