The Traveling Salesman: Computational Solutions for TSP Applications
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—fifteen 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 five 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 find a reasonable algorithm failed, I could not help enumerating all possible routes and then select the best one.
1114935258
The Traveling Salesman: Computational Solutions for TSP Applications
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—fifteen 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 five 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 find a reasonable algorithm failed, I could not help enumerating all possible routes and then select the best one.
54.99
In Stock
5
1
The Traveling Salesman: Computational Solutions for TSP Applications
223
The Traveling Salesman: Computational Solutions for TSP Applications
223Paperback(1994)
$54.99
54.99
In Stock
Product Details
| ISBN-13: | 9783540583349 |
|---|---|
| Publisher: | Springer Berlin Heidelberg |
| Publication date: | 09/29/1994 |
| Series: | Lecture Notes in Computer Science , #840 |
| Edition description: | 1994 |
| Pages: | 223 |
| Product dimensions: | 8.27(w) x 10.98(h) x 0.02(d) |
From the B&N Reads Blog