ScholarGate
Msaidizi

Linganisha mbinu

Pitia mbinu ulizochagua bega kwa bega; safu zinazotofautiana zinaangaziwa.

Algoriti ya Pseudoflow×Algoriti ya Lerchs-Grossmann×
NyanjaUhandisi wa MadiniUhandisi wa Madini
FamiliaProcess / pipelineProcess / pipeline
Mwaka wa asili19921965
MwanzilishiDorit S. HochbaumHelmut Lerchs and Israel Grossmann
AinaEfficient algorithm for maximum closure problemGraph-theoretic algorithm for pit limit optimization
Chanzo asiliaHochbaum, 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 ↗
Majina mbadalaPseudoflow Algorithm, Hochbaum AlgorithmLerchs-Grossmann Method, LG Algorithm
Zinazohusiana34
MuhtasariThe 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.
ScholarGateSeti ya data
  1. v1
  2. 2 Vyanzo
  3. PUBLISHED
  1. v1
  2. 2 Vyanzo
  3. PUBLISHED

Nenda kwenye utafutaji Pakua slaidi

ScholarGateLinganisha mbinu: Pseudoflow · Lerchs-Grossmann Algorithm. Imepatikana 2026-06-15 kutoka https://scholargate.app/sw/compare