Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems
From MaRDI portal
Publication:317432
DOI10.1016/J.DAM.2016.06.026zbMATH Open1351.90050OpenAlexW2290596303MaRDI QIDQ317432FDOQ317432
Authors: Tibor Illés, Richárd Molnár-Szipai 
Publication date: 30 September 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.cs.elte.hu/opres/orr/download/ORR_2015_02.pdf
Recommendations
- Strongly polynomial dual simplex methods for the maximum flow problem
- On strongly polynomial dual simplex algorithms for the maximum flow problem
- A strongly polynomial algorithm for generalized flow maximization
- A strongly polynomial algorithm for generalized flow maximization
- On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem
- A simpler and faster strongly polynomial algorithm for generalized flow maximization
- A simpler and faster strongly polynomial algorithm for generalized flow maximization
- On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds
- Strongly polynomial Pivot algorithms for maximal flow problems
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A polynomial time primal network simplex algorithm for minimum cost flows
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
- Pivot rules for linear programming: A survey on recent theoretical developments
- On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem
- Strongly polynomial dual simplex methods for the maximum flow problem
- A Monotonic Build-Up Simplex Algorithm for Linear Programming
- Exterior point simplex-type algorithms for linear and network optimization problems
- On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds
- Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time
Cited In (4)
- Flow maximization problem as linear programming problem with capacity constraints
- Complexity analysis for maximum flow problems with arc reversals
- On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds
- Strongly polynomial Pivot algorithms for maximal flow problems
This page was built for publication: Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q317432)
