Characterization of all optimal solutions and parametric maximal mows in networks (Q3683846): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical investigations on the maximal flow algorithm of Karzanov / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of all minimum cuts in a network and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Solution of Sequencing Problems with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent extreme flows and application to min concave cost flow problems / rank
 
Normal rank

Latest revision as of 18:07, 14 June 2024

scientific article
Language Label Description Also known as
English
Characterization of all optimal solutions and parametric maximal mows in networks
scientific article

    Statements

    Characterization of all optimal solutions and parametric maximal mows in networks (English)
    0 references
    0 references
    1985
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    epsilon flows
    0 references
    max flow problem
    0 references
    parametric arc capacities
    0 references
    all optimal solutions
    0 references
    decomposition
    0 references
    0 references