About the minimum mean cycle-canceling algorithm (Q499347): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Primal Simplex Algorithm for Degenerate Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Experimental Study of Minimum Mean Cycle Algorithms / 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: Q3266141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on the number of minimum-mean cycle cancellations and related results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new version of the improved primal simplex for degenerate linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3908745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / 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: Faster parametric shortest path and minimum‐balance algorithms / rank
 
Normal rank

Revision as of 19:54, 10 July 2024

scientific article
Language Label Description Also known as
English
About the minimum mean cycle-canceling algorithm
scientific article

    Statements

    About the minimum mean cycle-canceling algorithm (English)
    0 references
    0 references
    0 references
    0 references
    30 September 2015
    0 references
    network flow problem
    0 references
    residual network
    0 references
    flow decomposition
    0 references
    minimum mean cycle
    0 references
    complexity analysis
    0 references
    strongly polynomial algorithm
    0 references

    Identifiers