ScholarGate
Assistent
Process / pipelineNetwork Flow and Graph Optimization

Pseudoflow Algoritmen

Pseudoflow Algoritmen, udviklet af Dorit Hochbaum i 1992, er en polynomiel-tids algoritme til beregning af maksimale vægtede lukninger i rettede acykliske grafer. Inden for minedrift løser den problemet med den ultimative grænse for udvinding mere effektivt end tidligere metoder. Ved at vedligeholde feasible pseudoflows og iterativt eliminere noder med negativ omkostning opnår den nær-optimal praktisk ydeevne, selv på blokmodeller i industriel skala.

Åbn i MethodMindSnartVideoSnartDownload slides

Læs hele metoden

Kun for medlemmer

Log ind med en gratis konto for at læse dette afsnit.

Log ind

Method map

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

Pseudoflow Algoritmen
Lanes Cut-off Grade ModelLerchs-Grossmann Algorit…Optimering af Stope-layo…

Kilder

  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 ↗

Sådan citerer du denne side

ScholarGate. (2026, June 3). Pseudoflow Algorithm for Maximum Weighted Closure. ScholarGate. https://scholargate.app/da/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 →

Refereret af

Lanes Cut-off Grade ModelLerchs-Grossmann Algoritmen

Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →

ScholarGate — Pseudoflow (Pseudoflow Algorithm for Maximum Weighted Closure). Hentet 2026-06-15 fra https://scholargate.app/da/mining-engineering/pseudoflow · Datasæt: https://doi.org/10.5281/zenodo.20539026