A polynomial-time simplex method for the maximum k-flow problem
From MaRDI portal
A polynomial-time simplex method for the maximum \(k\)-flow problem
Recommendations
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n^ 2m) time
- Strongly polynomial dual simplex methods for the maximum flow problem
- On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem
- On strongly polynomial dual simplex algorithms for the maximum flow problem
- A polynomial dual simplex algorithm fot the generalized circulation problem.
Cites work
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n^ 2m) time
- Disjoint (s, t)‐cuts in a network
- Edge-packings of graphs and network reliability
- Maximal Flow Through a Network
- 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
(9)- A faster polynomial algorithm for the constrained maximum flow problem
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n^ 2m) time
- scientific article; zbMATH DE number 871948 (Why is no real title available?)
- Approximation Algorithms for k-Hurdle Problems
- Approximation algorithms for \(k\)-hurdle problems
- A polynomial dual simplex algorithm fot the generalized circulation problem.
- A primal simplex variant for the maximum-flow problem
- On the k-cut subgraph polytope
- A note on the problem of \(r\) disjoint \((s, t)\)-cuts and some related issues
This page was built for publication: A polynomial-time simplex method for the maximum \(k\)-flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688924)
