Polynomial auction algorithms for shortest paths (Q1804574)

From MaRDI portal
Revision as of 08:32, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Polynomial auction algorithms for shortest paths
scientific article

    Statements

    title
    Polynomial auction algorithms for shortest paths (English)
    0 references
    author
    Dimitri P. Bertsekas
    0 references
    Stefano Pallottino
    0 references
    Maria Grazia Scutellà
    0 references
    publication date
    11 June 1995
    0 references
    zbMATH Keywords
    shortest path
    0 references
    network optimization
    0 references
    strongly polynomial variations
    0 references
    auction algorithm
    0 references

    Identifiers

    DOI
    10.1007/BF01302891
    0 references
    Mathematics Subject Classification ID
    90C35
    0 references
    91B26
    0 references
    90C60
    0 references
    zbMATH DE Number
    755301
    0 references
    OpenAlex ID
    W2119991623
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1804574&oldid=36897972"
    Powered by MediaWiki