A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem
From MaRDI portal
Publication:5189003
DOI10.1287/opre.1080.0572zbMath1181.90271OpenAlexW1986096063MaRDI QIDQ5189003
Dorit S. Hochbaum, Bala Chandran
Publication date: 6 March 2010
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4fde79f7210afd72a7e94ba982f862deafce21ba
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (12)
Maximum likelihood analysis of the Ford-Fulkerson method on special graphs ⋮ Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm ⋮ Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search ⋮ MineLib: a library of open pit mining problems ⋮ Enhanced instance space analysis for the maximum flow problem ⋮ Simplifications and speedups of the pseudoflow algorithm ⋮ A survey on exact algorithms for the maximum flow and minimum‐cost flow problems ⋮ Nuclear threat detection with mobile distributed sensor networks ⋮ Adjacency-Clustering and Its Application for Yield Prediction in Integrated Circuit Manufacturing ⋮ Regenerator location problem: polyhedral study and effective branch-and-cut algorithms ⋮ A new model for automated pushback selection ⋮ Evaluating performance of image segmentation criteria and techniques
Uses Software
This page was built for publication: A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem
