原书出处
Introduction to Algorithms, Fourth Edition
29 第29章 线性规划
at every vertex. The goal is to find, among all feasible flows, the one of minimum cost.
We call this problem the minimum-cost-circulation problem. a. Formulate the minimum-cost-circulation problem as a linear program. b. Suppose that for all edges (u, v) ∈ E, we have a(u, v) > 0. What does an optimal solution to the minimum-cost-circulation problem look like? c. Formulate the maximum-flow problem as a
minimum-cost-circulation problem linear program. That is, given a maximum-flow problem in
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter029.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea