原书出处
Introduction to Algorithms, Fourth Edition
29 第29章 线性规划
be a real-valued function that satisfies the flow-conservation and capacity constraints.
We define fuv, the aggregate flow, to be the sum of the various commodity flows, so that . The aggregate flow on edge (u, v) must be no more than the capacity of edge (u, v). This problem has no objective function: the question is to determine whether such a flow exists. Thus the linear program for this problem has a
“null” objective function: The only known polynomial-time algorithm for this problem expr
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter029.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea