विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| लेन का कट-ऑफ ग्रेड मॉडल× | स्यूडोफ्लो एल्गोरिथम× | |
|---|---|---|
| क्षेत्र | खनन इंजीनियरिंग | खनन इंजीनियरिंग |
| परिवार | Process / pipeline | Process / pipeline |
| उद्भव वर्ष≠ | 1988 | 1992 |
| प्रवर्तक≠ | K. F. Lane | Dorit S. Hochbaum |
| प्रकार≠ | Economic optimization framework for ore classification | Efficient 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 Model | Pseudoflow Algorithm, Hochbaum Algorithm |
| संबंधित | 3 | 3 |
| सारांश≠ | 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डेटासेट ↗ |
|
|