ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

Pseudoflow Algorithm×Model mezní těžební jakosti (Lane's Cut-off Grade Model)×
OborHornictvíHornictví
RodinaProcess / pipelineProcess / pipeline
Rok vzniku19921988
TvůrceDorit S. HochbaumK. F. Lane
TypEfficient algorithm for maximum closure problemEconomic optimization framework for ore classification
Původní zdrojHochbaum, 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 ↗
Další názvyPseudoflow Algorithm, Hochbaum AlgorithmLane Model, Cut-off Grade Optimization, Lane's Optimization Model
Příbuzné33
Shrnutí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.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.
ScholarGateDatová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: Pseudoflow · Cut-off Grade (Lane). Získáno 2026-06-17 z https://scholargate.app/cs/compare