Sammenlign metoder

	Lerchs-Grossmann Algoritmen	Mine ventilation	Pseudoflow Algoritmen
Fagområde	Minedrift	Minedrift	Minedrift
Familie	Process / pipeline	Process / pipeline	Process / pipeline
Oprindelsesår	1965	1880	1992
Ophavsperson	Helmut Lerchs and Israel Grossmann	Mining Engineering Practice	Dorit S. Hochbaum
Type	Graph-theoretic algorithm for pit limit optimization	System design for safe air quality and worker cooling in underground mines	Efficient algorithm for maximum closure problem
Oprindelig kilde	Lerchs, H., & Grossmann, I. F. (1965). Optimum design of open-pit mines. Canadian Mining and Metallurgical Bulletin, 58(633), 47-54.	Hartman, H. L., Mutmansky, J. M., Ramani, R. V., & Wang, Y. J. (2012). Mine ventilation and ambient air quality. Society for Mining, Metallurgy & Exploration, Inc.	Hochbaum, D. S. (1992). A new-old algorithm for minimum-cut and maximum-flow problems. Journal of the ACM, 1(1), 76-109.
Aliasser	Lerchs-Grossmann Method, LG Algorithm	Underground Mine Ventilation, Air Flow Design, Mine Haulage Ventilation	Pseudoflow Algorithm, Hochbaum Algorithm
Relaterede	4	3	3
Resumé	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.	Mine ventilation is the design and operation of systems that deliver fresh air to underground mining areas and remove contaminated air, heat, and hazardous gases. It is critical for worker safety and productivity, maintaining breathable air (sufficient oxygen, low dust and gas concentrations) and acceptable temperatures. Proper ventilation design requires calculating heat loads from mining operations, determining required air volumes, and designing shaft/drift geometry to deliver adequate flow.	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.