Maximum-throughput dynamic network flows (Q3664790)

From MaRDI portal
Revision as of 09:24, 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
Maximum-throughput dynamic network flows
scientific article

    Statements

    title
    Maximum-throughput dynamic network flows (English)
    0 references
    DOI
    10.1007/BF02591946
    0 references
    author
    James B. Orlin
    0 references
    publication date
    1983
    0 references
    Mathematics Subject Classification ID
    90B10
    0 references
    90C10
    0 references
    90C35
    0 references
    90B35
    0 references
    zbMATH DE Number
    3817392
    0 references
    zbMATH Keywords
    maximum throuhput dynamic network flow problem
    0 references
    infinite horizon
    0 references
    vehicle scheduling
    0 references
    periodic scheduling
    0 references
    Wikidata QID
    Q59592750
    0 references
    OpenAlex ID
    W2142745220
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3664790&oldid=36870223"
    Powered by MediaWiki