مقایسهٔ روشها
روشهای انتخابی خود را کنار هم مرور کنید؛ ردیفهای متفاوت برجسته شدهاند.
| الگوریتم شبهجریان (Pseudoflow Algorithm)× | الگوریتم لرش-گروسمن× | |
|---|---|---|
| حوزه | مهندسی معدن | مهندسی معدن |
| خانواده | Process / pipeline | Process / pipeline |
| سال پیدایش≠ | 1992 | 1965 |
| پدیدآور≠ | Dorit S. Hochbaum | Helmut Lerchs and Israel Grossmann |
| نوع≠ | Efficient algorithm for maximum closure problem | Graph-theoretic algorithm for pit limit optimization |
| منبع بنیادین≠ | 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 ↗ |
| نامهای دیگر | Pseudoflow Algorithm, Hochbaum Algorithm | Lerchs-Grossmann Method, LG Algorithm |
| مرتبط≠ | 3 | 4 |
| خلاصه≠ | 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. |
| ScholarGateمجموعهداده ↗ |
|
|