---

＜電子ブック＞
The Traveling Salesman : Computational Solutions for TSP Applications / by Gerhard Reinelt
(Lecture Notes in Computer Science. ISSN:16113349 ; 840)

版	1st ed. 1994.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1994
本文言語	英語
大きさ	VIII, 223 p. 3 illus : online resource
著者標目	*Reinelt, Gerhard author SpringerLink (Online service)
件　名	LCSH:Computer graphics LCSH:Discrete mathematics LCSH:Algorithms LCSH:Business information services LCSH:Dynamics LCSH:Nonlinear theories LCSH:Operations research FREE:Computer Graphics FREE:Discrete Mathematics FREE:Algorithms FREE:IT in Business FREE:Applied Dynamical Systems FREE:Operations Research and Decision Theory
一般注記	Basic Concepts -- Related Problems and Applications -- Geometric Concepts -- Candidate Sets -- Construction Heuristics -- Improving Solutions -- Heuristics for Large Geometric Problems -- Further Heuristic Approaches -- Lower Bounds -- A Case Study: TSPs in Printed Circuit Board Production -- Practical TSP Solving Still today I am receiving requests for reprints of the book, but unfortunately it is out of print. Therefore, since the book still seems to receive some attention, I p- posed to Springer Verlag to provide a free online edition. I am very happy that Springer agreed. Except for the correction of some typographical errors, the online edition is just a copy of the printed version, no updates have been made. In particular, Table 13.1 gives the status of TSPLIB at the time of publishing the book. For accessing TSPLIB the link http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/ should be used instead of following the procedure described in Chapter 13. Heidelberg, January 2001 Gerhard Reinelt Preface More than ?fteen years ago, I was faced with the following problem in an assignment for a class in computer science. A brewery had to deliver beer to ?ve stores, and the task was to write a computer program for determining the shortest route for the truck driver to visit all stores and return to the brewery. All my attemps to ?nd a reasonable algorithm failed, I could not help enumerating all possible routes and then select the best one HTTP:URL=https://doi.org/10.1007/3-540-48661-5

 類似資料