On strongly polynomial dual simplex algorithms for the maximum flow problem
From MaRDI portal
Recommendations
- Strongly polynomial dual simplex methods for the maximum flow problem
- On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n^ 2m) time
- Strongly polynomial Pivot algorithms for maximal flow problems
Cites work
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- A Fast Parametric Maximum Flow Algorithm and Applications
- A new approach to the maximum-flow problem
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n^ 2m) time
- An efficient implementation of the network simplex method
- Network flows. Theory, algorithms, and applications.
- On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
Cited in
(10)- An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems
- scientific article; zbMATH DE number 4126976 (Why is no real title available?)
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems
- A strongly polynomial algorithm for generalized flow maximization
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n^ 2m) time
- A polynomial-time simplex method for the maximum \(k\)-flow problem
- Polynomial dual network simplex algorithms
- Strongly polynomial Pivot algorithms for maximal flow problems
- scientific article; zbMATH DE number 1187162 (Why is no real title available?)
- A new strongly polynomial dual network simplex algorithm
This page was built for publication: On strongly polynomial dual simplex algorithms for the maximum flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373745)
