ScholarGate
Msaidizi
Process / pipelineNetwork Flow and Graph Optimization

Algoriti ya Pseudoflow

Algoriti ya Pseudoflow, iliyoanzishwa na Dorit Hochbaum mwaka 1992, ni algoriti ya muda wa polynomiali kwa ajili ya kuhesabu vishikizo vilivyopimwa zaidi katika grafu zinazoelekezwa zisizo na mizunguko. Katika uchimbaji madini, hutatua tatizo la kikomo cha mwisho cha shimo kwa ufanisi zaidi kuliko mbinu za awali. Kwa kudumisha pseudoflow zinazowezekana na kuondoa nodi za gharama hasi mara kwa mara, hufikia utendaji wa karibu-bora wa kivitendo hata kwenye mifumo mikuu ya vizuizi vya kiwango cha viwanda.

Fungua katika MethodMindHivi karibuniVideoHivi karibuniDownload slides

Soma mbinu kamili

Kwa wanachama pekee

Ingia kwa akaunti ya bure ili kusoma sehemu hii.

Ingia

Method map

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

Vyanzo

  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

Jinsi ya kunukuu ukurasa huu

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

Imerejelewa na

ScholarGatePseudoflow (Pseudoflow Algorithm for Maximum Weighted Closure). Imepatikana 2026-06-15 kutoka https://scholargate.app/sw/mining-engineering/pseudoflow · Seti ya data: https://doi.org/10.5281/zenodo.20539026