ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

نموذج حد القطع لـ لين×خوارزمية ليرش-غروسمان×خوارزمية التدفق الزائف×
المجالهندسة التعدينهندسة التعدينهندسة التعدين
العائلةProcess / pipelineProcess / pipelineProcess / pipeline
سنة النشأة198819651992
صاحب الطريقةK. F. LaneHelmut Lerchs and Israel GrossmannDorit S. Hochbaum
النوعEconomic optimization framework for ore classificationGraph-theoretic algorithm for pit limit optimizationEfficient 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 ↗Lerchs, H., & Grossmann, I. F. (1965). Optimum design of open-pit mines. Canadian Mining and Metallurgical Bulletin, 58(633), 47-54. 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 ModelLerchs-Grossmann Method, LG AlgorithmPseudoflow Algorithm, Hochbaum Algorithm
ذات صلة343
الملخص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.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
  1. v1
  2. 2 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Cut-off Grade (Lane) · Lerchs-Grossmann Algorithm · Pseudoflow. استُرجع بتاريخ 2026-06-18 من https://scholargate.app/ar/compare