Process / pipelineNetwork Flow and Graph Optimization
Pseudoflow Algorithm
The Pseudoflow Algorithm, developed by Dorit Hochbaum in 1992, is a polynomial-time algorithm for computing maximum weighted closures in directed acyclic graphs. In mining, it solves the ultimate pit limit problem more efficiently than earlier methods. By maintaining feasible pseudoflows and iteratively eliminating negative-cost nodes, it achieves near-optimal practical performance even on industrial-scale block models.
Open in MethodMindSoonVideoSoon
Read the full method
Members only
Sign inSign in with a free account to read this section.
Sources
- Hochbaum, D. S. (1992). A new-old algorithm for minimum-cut and maximum-flow problems. Journal of the ACM, 1(1), 76-109. DOI: 10.1145/147508.147520 ↗
- Hochbaum, D. S. (2001). A fast algorithms for mining and metallurgical pits optimization. SIAM Journal on Computing, 30(4), 1096-1117. link ↗