ScholarGate
助手
Process / pipelineNetwork Flow and Graph Optimization

伪流算法

伪流算法(Pseudoflow Algorithm)由 Dorit Hochbaum 于 1992 年提出,是一种用于计算有向无环图中最大加权闭合(maximum weighted closure)的多项式时间算法。在矿业领域,它比早期方法更有效地解决了最终边界问题。通过维护可行伪流并迭代消除负成本节点,即使在工业规模的块模型上也能实现接近最优的实际性能。

在 MethodMind 中打开即将推出视频即将推出Download slides

阅读完整方法

仅限会员

使用免费账户登录即可阅读本节。

登录

Method map

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

来源

  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

如何引用本页

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

被引用于

ScholarGatePseudoflow (Pseudoflow Algorithm for Maximum Weighted Closure). 于 2026-06-15 检索自 https://scholargate.app/zh/mining-engineering/pseudoflow · 数据集: https://doi.org/10.5281/zenodo.20539026