ScholarGate
Βοηθός

Σύγκριση μεθόδων

Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.

Μοντέλο Οριακής Τιμής Ορυκτού του Lane×Αλγόριθμος Ψευδοροής×
ΠεδίοΜεταλλευτική ΜηχανικήΜεταλλευτική Μηχανική
ΟικογένειαProcess / pipelineProcess / pipeline
Έτος προέλευσης19881992
ΔημιουργόςK. F. LaneDorit S. Hochbaum
ΤύποςEconomic optimization framework for ore classificationEfficient algorithm for maximum closure problem
Θεμελιώδης πηγήLane, 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 ↗
Εναλλακτικές ονομασίεςLane Model, Cut-off Grade Optimization, Lane's Optimization ModelPseudoflow Algorithm, Hochbaum Algorithm
Συναφείς33
Σύνοψη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.
ScholarGateΣύνολο δεδομένων
  1. v1
  2. 2 Πηγές
  3. PUBLISHED
  1. v1
  2. 2 Πηγές
  3. PUBLISHED

Μετάβαση στην αναζήτηση Λήψη διαφανειών

ScholarGateΣύγκριση μεθόδων: Cut-off Grade (Lane) · Pseudoflow. Ανακτήθηκε στις 2026-06-18 από https://scholargate.app/el/compare