|
|
|
|
| LEADER |
01670nam a2200361 a 4500 |
| 001 |
1402887 |
| 005 |
20171111233406.0 |
| 008 |
940714s1994 gr r 000 0 eng d |
| 020 |
|
|
|a 3540583343
|q Berlin : acid-free paper
|
| 020 |
|
|
|a 0387583343
|q New York : acid-free paper
|
| 040 |
|
|
|a GR-ChTUC
|b gre
|
| 050 |
|
|
|a T57.78
|b .R47 1994
|
| 082 |
|
0 |
|2 20
|a 511/.5
|
| 082 |
|
0 |
|2 22
|a 004.015113
|
| 100 |
1 |
|
|a Reinelt, G.
|q (Gerhard)
|
| 245 |
1 |
4 |
|a The traveling salesman :
|b computational solutions for TSP applications /
|c Gerhard Reinelt
|
| 260 |
|
|
|a Berlin
|b Springer-Verlag,
|c c1994
|a New York :
|
| 300 |
|
|
|a viii, 223 p. :
|b ill. ;
|c 24 cm.
|
| 490 |
0 |
|
|a Lecture notes in computer science ;
|v 840
|
| 504 |
|
|
|a Includes bibliographical references (p. [214]-221) and index.
|
| 504 |
|
|
|a Includes bibliography and index
|
| 504 |
|
|
|a Includes bibliographical references and index.
|
| 505 |
1 |
|
|a 1. Introduction -- 2. Basic Concepts -- 3. Related Problems andApplications -- 4. Geometric Concepts -- 5. Candidate Sets -- 6.Construction Heuristics -- 7. Improving Solutions -- 8. Heuristics forLarge Geometric Problems -- 9. Further Heuristic Approaches -- 10.Lower Bounds -- 11. A Case Study: TSPs in PCB Production -- 12.Practical TSP Solving -- Appendix: TSPLIB.
|
| 650 |
1 |
0 |
|a Traveling-salesman problem
|
| 650 |
1 |
0 |
|a Heuristic programming
|
| 650 |
1 |
0 |
|a Algorithms
|
| 650 |
|
0 |
|a Computer science
|
| 650 |
|
0 |
|a Traveling-salesman problem
|
| 650 |
|
0 |
|a Heuristic programming
|
| 650 |
|
0 |
|a Algorithms
|
| 650 |
1 |
0 |
|a Traveling
|x - Salesman problem
|
| 710 |
|
|
|a Springer
|
| 952 |
|
|
|a GrAtEKP
|b 59cd24bb6c5ad1344610add6
|c 998a
|d 945l
|e 004.015113 LNCS ReiG t 1994 840
|t 1
|x m
|z Books
|
