A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550)

From MaRDI portal
Revision as of 20:49, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
scientific article

    Statements

    A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (English)
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    0 references
    \(k\)-splittable flow
    0 references
    heuristic
    0 references
    maximum concurrent flow
    0 references
    multicommodity
    0 references
    throughput
    0 references
    0 references