A composite algorithm for a concave-cost network flow problem (Q3827773)

From MaRDI portal
Revision as of 16:42, 19 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A composite algorithm for a concave-cost network flow problem
scientific article

    Statements

    A composite algorithm for a concave-cost network flow problem (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    routing multiple commodities
    0 references
    origin-destination pairs
    0 references
    minimum total cost
    0 references
    Economies of scale in arc flow costs
    0 references
    transportation planning
    0 references
    design of communication networks
    0 references
    plant location
    0 references
    capacity expansion
    0 references
    lower bounds
    0 references
    heuristic
    0 references
    computational results
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references