ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

Modèle de seuil de teneur de Lane×Algorithme Pseudoflow×
DomaineGénie minierGénie minier
FamilleProcess / pipelineProcess / pipeline
Année d'origine19881992
Auteur d'origineK. F. LaneDorit S. Hochbaum
TypeEconomic optimization framework for ore classificationEfficient algorithm for maximum closure problem
Source fondatriceLane, 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 ↗
AliasLane Model, Cut-off Grade Optimization, Lane's Optimization ModelPseudoflow Algorithm, Hochbaum Algorithm
Apparentées33
Résumé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 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.
ScholarGateJeu de données
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 2 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: Cut-off Grade (Lane) · Pseudoflow. Consulté le 2026-06-18 sur https://scholargate.app/fr/compare