A note on the pratical performance of the auction algorithm for the shortest path

    Research output: Contribution to journalJournal articleResearchpeer-review

    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.
    Original languageEnglish
    JournalRicerca Operativa
    Volume28
    Issue number87
    Pages (from-to)23-31
    Publication statusPublished - 1998

    Keywords

    • auction algorithm
    • performance results
    • shortest path problem

    Cite this