About the minimum mean cycle-canceling algorithm
From MaRDI portal
Publication:499347
DOI10.1016/J.DAM.2014.07.005zbMATH Open1331.90088OpenAlexW2153601281MaRDI QIDQ499347FDOQ499347
Authors: Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke 
Publication date: 30 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.07.005
Recommendations
- New polynomial-time cycle-canceling algorithms for minimum-cost flows
- Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow
- Tight bounds on the number of minimum-mean cycle cancellations and related results
- On dual minimum cost flow algorithms (extended abstract)
- The minimum mean cycle-canceling algorithm for linear programs
complexity analysisflow decompositionstrongly polynomial algorithmminimum mean cyclenetwork flow problemresidual network
Cites Work
- Network flows. Theory, algorithms, and applications.
- Maximal Flow Through a Network
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A data structure for dynamic trees
- A characterization of the minimum cycle mean in a digraph
- Decomposition Principle for Linear Programs
- A strongly polynomial minimum cost circulation algorithm
- Finding minimum-cost circulations by canceling negative cycles
- Title not available (Why is that?)
- An improved primal simplex algorithm for degenerate linear programs
- A new version of the improved primal simplex for degenerate linear programs
- Faster parametric shortest path and minimum‐balance algorithms
- An Experimental Study of Minimum Mean Cycle Algorithms
- Tight bounds on the number of minimum-mean cycle cancellations and related results
- A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
Cited In (11)
- Dynamic constraint and variable aggregation in column generation
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- Title not available (Why is that?)
- A strongly polynomial contraction-expansion algorithm for network flow problems
- The minimum mean cycle-canceling algorithm for linear programs
- The conditional \(p\)-dispersion problem
- Decomposition theorems for linear programs
- Heterogeneous Multi-resource Allocation with Subset Demand Requests
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
- Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm
- Tight bounds on the number of minimum-mean cycle cancellations and related results
This page was built for publication: About the minimum mean cycle-canceling algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499347)
