The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths (Q741538)

From MaRDI portal
Revision as of 01:08, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
scientific article

    Statements

    The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths (English)
    0 references
    0 references
    0 references
    12 September 2014
    0 references
    0 references
    dynamic network flow
    0 references
    universally quickest transshipment
    0 references
    uniform path-lengths
    0 references
    0 references