Incremental network design with shortest paths (Q296857)

From MaRDI portal
Revision as of 10:59, 29 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57955347, #quickstatements; #temporary_batch_1722243545156)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Incremental network design with shortest paths
scientific article

    Statements

    title
    Incremental network design with shortest paths (English)
    0 references
    author
    Matthew Baxter
    0 references
    Tarek Elgindy
    0 references
    Andreas T. Ernst
    0 references
    Thomas Kalinowski
    0 references
    publication date
    23 June 2016
    0 references
    zbMATH Keywords
    network design
    0 references
    multi-period
    0 references
    heuristic
    0 references
    approximation algorithm
    0 references
    integer programming
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90B10
    0 references
    90C10
    0 references
    90C35
    0 references
    90C59
    0 references
    zbMATH DE Number
    6597563
    0 references
    OpenAlex ID
    W1991615243
    0 references
    Wikidata QID
    Q57955347
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q296857&oldid=36820701"
    Powered by MediaWiki