Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Model granicy opłacalności Lane'a× | Algorytm Pseudoprzepływu× | |
|---|---|---|
| Dziedzina | Inżynieria górnicza | Inżynieria górnicza |
| Rodzina | Process / pipeline | Process / pipeline |
| Rok powstania≠ | 1988 | 1992 |
| Twórca≠ | K. F. Lane | Dorit S. Hochbaum |
| Typ≠ | Economic optimization framework for ore classification | Efficient algorithm for maximum closure problem |
| Źródło pierwotne≠ | 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 ↗ |
| Inne nazwy≠ | Lane Model, Cut-off Grade Optimization, Lane's Optimization Model | Pseudoflow Algorithm, Hochbaum Algorithm |
| Pokrewne | 3 | 3 |
| Podsumowanie≠ | 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. |
| ScholarGateZbiór danych ↗ |
|
|