Efficient preflow push algorithms
From MaRDI portal
Publication:2471239
DOI10.1016/j.cor.2006.12.023zbMath1176.90068OpenAlexW2054400961MaRDI QIDQ2471239
Monica Gentili, Raffaele Cerulli, A. Iossa
Publication date: 22 February 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.12.023
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
- The maximum flow problem: A max-preflow approach
- On the complexity of preflow-push algorithms for maximum-flow problems
- On implementing the push-relabel method for the maximum flow problem
- An auction algorithm for the max-flow problem
- A new approach to the maximum-flow problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Implementing Goldberg's max-flow-algorithm ? A computational investigation
This page was built for publication: Efficient preflow push algorithms