Sammenlign metoder
Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.
| Pseudoflow Algoritmen× | Lanes Cut-off Grade Model× | |
|---|---|---|
| Fagområde | Minedrift | Minedrift |
| Familie | Process / pipeline | Process / pipeline |
| Oprindelsesår≠ | 1992 | 1988 |
| Ophavsperson≠ | Dorit S. Hochbaum | K. F. Lane |
| Type≠ | Efficient algorithm for maximum closure problem | Economic optimization framework for ore classification |
| Oprindelig kilde≠ | 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, K. F. (1988). The economic definition of ore: cutoff grades in theory and practice. Mining Journal Books, London. link ↗ |
| Aliasser≠ | Pseudoflow Algorithm, Hochbaum Algorithm | Lane Model, Cut-off Grade Optimization, Lane's Optimization Model |
| Relaterede | 3 | 3 |
| Resumé≠ | 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. | 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. |
| ScholarGateDatasæt ↗ |
|
|