Σύγκριση μεθόδων

	Αλγόριθμος Ψευδοροής	Αλγόριθμος Lerchs-Grossmann
Πεδίο	Μεταλλευτική Μηχανική	Μεταλλευτική Μηχανική
Οικογένεια	Process / pipeline	Process / pipeline
Έτος προέλευσης	1992	1965
Δημιουργός	Dorit S. Hochbaum	Helmut Lerchs and Israel Grossmann
Τύπος	Efficient algorithm for maximum closure problem	Graph-theoretic algorithm for pit limit optimization
Θεμελιώδης πηγή	Hochbaum, D. S. (1992). A new-old algorithm for minimum-cut and maximum-flow problems. Journal of the ACM, 1(1), 76-109.	Lerchs, H., & Grossmann, I. F. (1965). Optimum design of open-pit mines. Canadian Mining and Metallurgical Bulletin, 58(633), 47-54.
Εναλλακτικές ονομασίες	Pseudoflow Algorithm, Hochbaum Algorithm	Lerchs-Grossmann Method, LG Algorithm
Συναφείς	3	4
Σύνοψη	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.	The Lerchs-Grossmann Algorithm is a graph-theoretic method for determining the ultimate pit limit in open-pit mining operations. Introduced by Helmut Lerchs and Israel Grossmann in 1965, it maximizes the net present value of extracted ore while respecting slope stability constraints. This algorithm forms the theoretical foundation for most modern pit optimization software.