知识卡片

普通读书笔记卡 · 3658.b.7

最大流可写成容量守恒线性规划

理解等级:中级

以各顶点对的流量为变量,约束每条边不超容量、非源汇顶点流入等于流出且流量非负,再最大化源点净流出。目标和约束全是线性的,因此最大流可直接写成线性规划。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第29章 线性规划 · 查看原书依据

      A maximum flow is a flow that satisfies these constraints and maximizes the flow value, which is the total flow coming out of the source minus the total flow into the source. A flow, therefore, satisfies linear constraints, and the value of a flow is a linear function. Recalling also that we assume that c(u, v) = 0 if (u, v) ∉ E and that

    参考来源

    - 位置:《算法导论(第4版)》第29章《线性规划》(OEBPS/chapter029.xhtml,文本字符[25000,30000))。 - 结论依据:原文说明单纯形、整数规划及网络优化模型的变量、约束与目标;对应图和公式已核对。 - 原始内容:A maximum flow is a flow that satisfies these constraints and maximizes the flow value, which is the total flow coming out of the source minus the total flow into the source. A flow, therefore, satisfies linear constraints, and the value of a flow is a linear function. Recalling also that we assume that c ( u , v ) = 0 if ( u , v ) ∉ E and that