ScholarGate
Asystent

Porównaj metody

Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.

Algorytm Pseudoprzepływu×Model granicy opłacalności Lane'a×Algorytm Lerchs-Grossmann×Optymalizacja układu komór wydobywczych×
DziedzinaInżynieria górniczaInżynieria górniczaInżynieria górniczaInżynieria górnicza
RodzinaProcess / pipelineProcess / pipelineProcess / pipelineProcess / pipeline
Rok powstania1992198819651960
TwórcaDorit S. HochbaumK. F. LaneHelmut Lerchs and Israel GrossmannMining Engineering Practice
TypEfficient algorithm for maximum closure problemEconomic optimization framework for ore classificationGraph-theoretic algorithm for pit limit optimizationOptimization framework for underground mine excavation design
Źródło pierwotneHochbaum, D. S. (1992). A new-old algorithm for minimum-cut and maximum-flow problems. Journal of the ACM, 1(1), 76-109. link ↗Lane, K. F. (1988). The economic definition of ore: cutoff grades in theory and practice. Mining Journal Books, London. link ↗Lerchs, H., & Grossmann, I. F. (1965). Optimum design of open-pit mines. Canadian Mining and Metallurgical Bulletin, 58(633), 47-54. link ↗Brady, B. H. G., & Brown, E. T. (2004). Rock mechanics for underground mining. Springer Science+Business Media. link ↗
Inne nazwyPseudoflow Algorithm, Hochbaum AlgorithmLane Model, Cut-off Grade Optimization, Lane's Optimization ModelLerchs-Grossmann Method, LG AlgorithmStope Design, Underground Mine Layout, Panel Design
Pokrewne3343
PodsumowanieThe 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.Lane's Cut-off Grade Model, developed by Kenneth F. Lane and formalized in his 1988 book, provides a rigorous economic framework for determining the minimum grade at which ore should be mined and processed. It accounts for variable mining costs, metallurgical recovery, and commodity prices to optimize profit per unit processed. The model is foundational in mining economics and underpins daily operational decisions at thousands of mines worldwide.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.Stope layout optimization is the process of designing the size, shape, and spatial arrangement of underground mine excavations (stopes) to maximize ore recovery while maintaining safety and economic viability. It balances the desire for large extraction volumes against rock mechanics constraints and support costs. The layout determines mining productivity, capital investment in support systems, and long-term mine life.
ScholarGateZbiór danych
  1. v1
  2. 2 Źródła
  3. PUBLISHED
  1. v1
  2. 2 Źródła
  3. PUBLISHED
  1. v1
  2. 2 Źródła
  3. PUBLISHED
  1. v1
  2. 2 Źródła
  3. PUBLISHED

Przejdź do wyszukiwania Pobierz slajdy

ScholarGatePorównaj metody: Pseudoflow · Cut-off Grade (Lane) · Lerchs-Grossmann Algorithm · Stope Layout. Pobrano 2026-06-18 z https://scholargate.app/pl/compare