@ARTICLE\{IMM1999-0141,
    author       = "J. Larsen and I. Pedersen",
    title        = "Experiments with the auction algorithm for the shortest path problem",
    year         = "1999",
    keywords     = "shortest path, auction, parallel computing, performance results",
    pages        = "403-421",
    journal      = "Nordic Journal of Computing",
    volume       = "6",
    editor       = "",
    number       = "",
    publisher    = "Publishing Association Nordic Journal of Computing",
    url          = "http://www2.compute.dtu.dk/pubdb/pubs/141-full.html",
    abstract     = "The auction approach for the shortest path problem (SPP) as introduced by Bertsekas is tested experimentally. Parallel algorithms using the auction approach are developed and tested. Both the sequential and parallel auction algorithms perform significantly worse than a state-of-the-art Dijkstra-like reference algorithm. Experiments are run on a distributed-memory {MIMD} class Meiko parallel computer."
}