ScholarGate
Asistent
Process / pipelineNetwork Flow and Graph Optimization

Algoritam Pseudoflow

Algoritam Pseudoflow, koji je razvila Dorit Hochbaum 1992. godine, jeste algoritam polinomijalnog vremena za izračunavanje maksimalnih ponderisanih zatvora u usmerenim acikličnim grafovima. U rudarstvu, rešava problem optimalne granice površinskog kopa efikasnije od ranijih metoda. Održavanjem dopustivih pseudotokova i iterativnim eliminisanjem čvorova sa negativnim troškovima, postiže praktično skoro optimalne performanse čak i na blok modelima industrijske veličine.

Otvorite u MethodMindUskoroVideoUskoroDownload slides

Pročitajte celu metodu

Samo za članove

Prijavite se besplatnim nalogom da biste pročitali ovaj odeljak.

Prijavite se

Method map

The neighbourhood of related methods — select a node to explore.

Algoritam Pseudoflow
Model Laneove granične v…Algoritam Lerchs-Grossma…Optimizacija rasporeda o…

Izvori

  1. Hochbaum, D. S. (1992). A new-old algorithm for minimum-cut and maximum-flow problems. Journal of the ACM, 1(1), 76-109. link ↗
  2. Hochbaum, D. S. (2001). A fast algorithms for mining and metallurgical pits optimization. SIAM Journal on Computing, 30(4), 1096-1117. link ↗

Kako citirati ovu stranicu

ScholarGate. (2026, June 3). Pseudoflow Algorithm for Maximum Weighted Closure. ScholarGate. https://scholargate.app/sr/mining-engineering/pseudoflow

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side →

Citirana u

Model Laneove granične vrednostiAlgoritam Lerchs-Grossmann

Uočili ste grešku na ovoj stranici? Prijavite je ili predložite ispravku →

ScholarGate — Pseudoflow (Pseudoflow Algorithm for Maximum Weighted Closure). Preuzeto 2026-06-15 sa https://scholargate.app/sr/mining-engineering/pseudoflow · Skup podataka: https://doi.org/10.5281/zenodo.20539026