Sammenlign metoder
Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.
| Pseudoflow Algoritmen× | Lerchs-Grossmann Algoritmen× | |
|---|---|---|
| Fagområde | Minedrift | Minedrift |
| Familie | Process / pipeline | Process / pipeline |
| Oprindelsesår≠ | 1992 | 1965 |
| Ophavsperson≠ | Dorit S. Hochbaum | Helmut Lerchs and Israel Grossmann |
| Type≠ | Efficient algorithm for maximum closure problem | Graph-theoretic algorithm for pit limit optimization |
| 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 ↗ | Lerchs, H., & Grossmann, I. F. (1965). Optimum design of open-pit mines. Canadian Mining and Metallurgical Bulletin, 58(633), 47-54. link ↗ |
| Aliasser | Pseudoflow Algorithm, Hochbaum Algorithm | Lerchs-Grossmann Method, LG Algorithm |
| Relaterede≠ | 3 | 4 |
| 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. | 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. |
| ScholarGateDatasæt ↗ |
|
|