原书出处
Introduction to Algorithms, Fourth Edition
29 第29章 线性规划
apacity. Consider, for example, the following generalization of the maximum-flow problem.
Suppose that, in addition to a capacity c(u, v) for each edge (u, v), you are given a real-valued cost a(u, v). As in the maximum-flow problem, assume that c(u, v) = 0 if (u, v) ∉ E and that there are no antiparallel edges. If you send fuv units of flow over edge (u, v), you incur a cost of a(u, v) · fuv. You are also given a flow demand d. You wish to send d units of flow from s to t while
minimizing the total cost ∑(u,v)∈E a(u, v) · fuv incurred by the flow. This problem is kn
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter029.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea