A note on the practical performance of the auction algorithm for shortest path problem (original) (raw)

1998

Abstract

Abstract The performance of the auction algorithms for the shortest paths has been investigated in four papers with di ering conclusions. In the following I report a series of experiments with the code from the two most recent papers. The experiments clearly show that the auction algorithm is inferior to state-of-theart shortest paths algorithms Keywords: shortest path problem, auction algorithm, performance results.

Jesper Larsen hasn't uploaded this paper.

Let Jesper know you want this paper to be uploaded.

Ask for this paper to be uploaded.