Custom cover image
Custom cover image

The traveling salesman : computational solutions for TSP applications / by Gerhard Reinelt

By: Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerLink Bücher | Lecture notes in computer science ; 840Publisher: Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 1994Description: Online-RessourceISBN:
  • 9783540486619
Subject(s): Additional physical formats: 9783540583349 | Buchausg. u.d.T.: The traveling salesman. Berlin : Springer, 1994. VIII, 223 S.DDC classification:
  • 006.6 23
  • 511/.5
MSC: MSC: *90C27 | 90-02RVK: RVK: SK 890LOC classification:
  • T385
  • T57.78
DOI: DOI: 10.1007/3-540-48661-5Online resources: 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 solvingPPN: PPN: 1649309309Package identifier: Produktsigel: ZDB-2-LNC | ZDB-2-SCS | ZDB-2-BAE | ZDB-2-SXCS | ZDB-2-SEB | GBV-SPRINGER-LNCS | ZDB-1-SLN
No physical items for this record
KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT