ScholarGate
Asistents

Salīdzināt metodes

Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.

Lane's modeli izgriezuma klases noteikšanai×Algoritms Pseudoflow×
NozareKalnrūpniecības inženierijaKalnrūpniecības inženierija
SaimeProcess / pipelineProcess / pipeline
Izcelsmes gads19881992
AutorsK. F. LaneDorit S. Hochbaum
TipsEconomic optimization framework for ore classificationEfficient algorithm for maximum closure problem
PirmavotsLane, K. F. (1988). The economic definition of ore: cutoff grades in theory and practice. Mining Journal Books, London. link ↗Hochbaum, D. S. (1992). A new-old algorithm for minimum-cut and maximum-flow problems. Journal of the ACM, 1(1), 76-109. link ↗
Citi nosaukumiLane Model, Cut-off Grade Optimization, Lane's Optimization ModelPseudoflow Algorithm, Hochbaum Algorithm
Saistītās33
KopsavilkumsLane'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 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.
ScholarGateDatu kopa
  1. v1
  2. 2 Avoti
  3. PUBLISHED
  1. v1
  2. 2 Avoti
  3. PUBLISHED

Doties uz meklēšanu Lejupielādēt slaidus

ScholarGateSalīdzināt metodes: Cut-off Grade (Lane) · Pseudoflow. Izgūts 2026-06-18 no https://scholargate.app/lv/compare