Overview

This book is devoted to the famous travelling salesman problem (TSP), which, is the task of finding a route of the 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.

Full Product Details

9783540583349

Table of Contents

Reviews

Without any doubt, I can recommend this book, both for practitioners as well as researchers, since it gives a concise and crisp overview of the heuristical approach to solving the TSP. OPTIMA

"""Without any doubt, I can recommend this book, both for practitioners as well as researchers, since it gives a concise and crisp overview of the heuristical approach to solving the TSP."" OPTIMA"

Author Information

Tab Content 6

Customer Reviews

Recent Reviews

Countries Available