| authors |
Pekny, J. F. and Miller, D.L. |
| year |
1988 |
| title |
Results from a Parallel Branch and Bound Algorithm for the Asymmetric Traveling Salesman Problem |
| source |
[1], 8, [6] p. : tables Pittsburgh, PA: Engineering Design Research Center, CMU, 1988. EDRC-06-42-88. includes bibliography |
| summary |
Computational results are presented for a parallel branch- and-bound algorithm that optimally solves the asymmetric traveling salesman problem. Results are presented for randomly generated problems with sizes ranging from 250 to 3000 cities |
| keywords |
search, parallel processing, algorithms, branch-and-bound |
| series |
CADline |
| references |
Content-type: text/plain
|
| last changed |
2003/06/02 13:58 |
|
