Terminology for Minimum-Cost Flow Problems 5. Any node where the net amount of flow generated is fixed at zero is a transshipment node Having the amount of flow out of the node equal the amount of flow into the node is referred to as conservation o们ow,(如果节点产生 的净流量恒为零,那么这个节点就称为转 运点,我们把流出帝点的量等于流入节点 的量称为流量守恒) Copyrigh2007c深圳大学管理学院运筹学16
Copyright 2007 © 深圳大学管理学院 运筹学 16 Terminology for Minimum-Cost Flow Problems 5. Any node where the net amount of flow generated is fixed at zero is a transshipment node. Having the amount of flow out of the node equal the amount of flow into the node is referred to as conservation of flow. (如果节点产生 的净流量恒为零，那么这个节点就称为转 运点，我们把流出节点的量等于流入节点 的量称为流量守恒)
Terminology for Minimum-Cost Flow Problems 6 The arrows in the network are called arcs (网络中的箭头称为弧) 7 The maximum amount of flow allowed through an arc is referred to as the capacity of that arc.(C 许通过某一条弧的最大流量称 为该弧的容量) Copyrigh2007c深圳大学管理学院运筹学17
Copyright 2007 © 深圳大学管理学院 运筹学 17 Terminology for Minimum-Cost Flow Problems 6. The arrows in the network are called arcs. (网络中的箭头称为弧) 7. The maximum amount of flow allowed through an arc is referred to as the capacity of that arc. (允 许通过某一条弧的最大流量称 为该弧的容量)
8 Assumptions of a Minimum-Cost Flow Problem 1. At least one of the nodes is a supply node(至少有一 个节点是侯应点 2 At least one of the other nodes is a demand node 至少有一个节点是求点) 3. All the remaining nodes are transshipment nodes (所有剩下的节点都是转运点) Copyrigh2007c深圳大学管理学院运筹学18
Copyright 2007 © 深圳大学管理学院 运筹学 18 Assumptions of a Minimum-Cost Flow Problem 1. At least one of the nodes is a supply node. (至少有一 个节点是供应点) 2. At least one of the other nodes is a demand node. (至少有一个节点是需求点) 3. All the remaining nodes are transshipment nodes. (所有剩下的节点都是转运点)
&2 Assumptions of a Minimum-Cost Flow Problem 4. Flow through an arc is only allowed in the direction indicated by the arrowhead where the maximum amount of flow is given by the capacity of that arc.(If flow can occur in both directions this would be represented by a pair of arcs pointing in opposite directions)(通过孤的流只允许沿看箭头 的方向流动,通过弧的最大流量取决于该弧 的客量如果流是双向的话,则需要用一对 箭头指向反的来表示] Copyrigh2007c深圳大学管理学院运筹学19
Copyright 2007 © 深圳大学管理学院 运筹学 19 Assumptions of a Minimum-Cost Flow Problem 4. Flow through an arc is only allowed in the direction indicated by the arrowhead, where the maximum amount of flow is given by the capacity of that arc. (If flow can occur in both directions, this would be represented by a pair of arcs pointing in opposite directions.) (通过弧的流只允许沿着箭头 的方向流动，通过弧的最大流量取决于该弧 的容量[如果流是双向的话，则需要用一对 箭头指向相反的弧来表示])
&2 Assumptions of a Minimum-Cost Flow Problem 5. The network has enough arcs with sufficient capacity to enable all the flow generated at the supply nodes to reach all the demand nodes。(网络中 有足够的孤提偿是够的客量,使 得所有在供应点中产生的流都能 够达到需求点) Copyrigh2007c深圳大学管理学院运筹学20
Copyright 2007 © 深圳大学管理学院 运筹学 20 Assumptions of a Minimum-Cost Flow Problem 5. The network has enough arcs with sufficient capacity to enable all the flow generated at the supply nodes to reach all the demand nodes. (网络中 有足够的弧提供足够的容量，使 得所有在供应点中产生的流都能 够达到需求点)