原书出处
Introduction to Algorithms, Fourth Edition
29 第29章 线性规划
e largest value that is less than or equal to all of the values in the set {du + w(u, v).
Therefore, it makes sense to maximize dv for all vertices v on a shortest path from s to t subject to these constraints, and maximizing dt achieves this goal. This linear program has |V| variables dv, one for each vertex v ∈ V. It also has |E| + 1 constraints: one for each edge, plus the additional constraint that the source
vertex’s shortest-path weight always has the value 0. Maximum flow Next, let’s express th
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter029.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea