知识卡片
网络单纯形专用于流问题
网络单纯形把单纯形法专门用于网络流问题。
它不是一般线性规划的新复杂度保证;书中指出在最短路、最大流、最小费用流等特定网络问题上,某些变体可在多项式时间运行。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第29章 线性规划 · 查看原书依据
Particularly noteworthy is the network-simplex algorithm, which is the simplex algorithm, specialized to network-flow problems. For certain network problems, including the shortest-paths, maximum-flow, and minimum-cost-flow problems, variants of the network-simplex algorithm run in polynomial time. See, for example, the article by Orlin [349] and the citations therein. 1 An
参考来源
- 位置:《算法导论(第4版)》第29章《线性规划》(OEBPS/chapter029.xhtml,文本字符[50000,51875))。
- 结论依据:原文陈述多商品流、对偶、可行性证书或网络优化的定义与条件;相应公式图已核对。
- 原始内容:Particularly noteworthy is the network-simplex algorithm, which is the simplex algorithm, specialized to network-flow problems. For certain network problems, including the shortest-paths, maximum-flow, and minimum-cost-flow problems, variants of the network-simplex algorithm run in polynomial time. See, for example, the article by Orlin [ 349 ] and the citations therein. 1 An