Combinatorial algorithms for inverse network flow problems (Q4798190)

From MaRDI portal
Revision as of 07:02, 10 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(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