Combinatorial algorithms for inverse network flow problems (Q4798190)

From MaRDI portal
Revision as of 14:43, 10 June 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59592562, #quickstatements; #temporary_batch_1718023025760)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1884750
Language Label Description Also known as
English
Combinatorial algorithms for inverse network flow problems
scientific article; zbMATH DE number 1884750

    Statements

    Combinatorial algorithms for inverse network flow problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 March 2003
    0 references
    0 references
    inverse optimization
    0 references
    maximum-flow problem
    0 references
    minimum-cut problem
    0 references
    minimum-cost flow problem minimum mean-cycle problem
    0 references
    minimax problems
    0 references
    0 references
    0 references