A note on the pratical performance of the auction algorithm for the shortest path |
Jesper Larsen
|
| Abstract | The performance of the auction algorithm for the shortest path problem has previously been investigated in four papers. Here the results of a series of new experiments with the code from the two most recent papers are reported. Experiments clearly show that the auction algorithm is inferior to the state-of-the-art shortest path algorithms. |
| Keywords | shortest path problem, auction algorithm, performance results |
| Type | Journal paper [With referee] |
| Journal | Ricerca Operativa |
| Year | 1998 Vol. 28 No. 87 pp. 23-31 |
| Publisher | AIRO |
| BibTeX data | [bibtex] |
| IMM Group(s) | Operations Research |