Minimum cost multiflows in undirected networks (Q1337137): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3352816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum-cost circulations by canceling negative cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3979310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedra related to undirected multicommodity flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some connectivity properties of Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial minimum cost circulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank

Latest revision as of 10:04, 23 May 2024

scientific article
Language Label Description Also known as
English
Minimum cost multiflows in undirected networks
scientific article

    Statements

    Minimum cost multiflows in undirected networks (English)
    0 references
    0 references
    1994
    0 references
    0 references
    edge-disjoint paths
    0 references
    undirected graph
    0 references
    minimum cost maximum multi(commodity) flow problem
    0 references
    \(c\)-admissible multiflow
    0 references
    pseudo- polynomial algorithm
    0 references
    half-integral optimal solution
    0 references