A faster polynomial algorithm for the constrained maximum flow problem
From MaRDI portal
Publication:1761207
DOI10.1016/j.cor.2012.01.010zbMath1251.90067OpenAlexW2004653858MaRDI QIDQ1761207
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.01.010
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10) Flows in graphs (05C21)
Related Items (2)
A generalized approximation framework for fractional network flow and packing problems ⋮ A network simplex method for the budget-constrained minimum cost flow problem
Cites Work
- A specialized network simplex algorithm for the constrained maximum flow problem
- A double scaling algorithm for the constrained maximum flow problem
- A strongly polynomial minimum cost circulation algorithm
- Increasing the Capacity of a Network: The Parametric Budget Problem
- Maximal Flow Through a Network
- Finding Minimum-Cost Circulations by Successive Approximation
- Faster algorithms for the shortest path problem
- A priority queue in which initialization and queue operations takeO(loglogD) time
- On RAM Priority Queues
- Priority queues: Small, monotone and trans-dichotomous
- A capacity scaling algorithm for the constrained maximum flow problem
- Faster Scaling Algorithms for Network Problems
- On a capacity scaling algorithm for the constrained maximum flow problem
- A constrained maximum flow problem†
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A faster polynomial algorithm for the constrained maximum flow problem
