equal
deleted
inserted
replaced
99 \f[ \min\sum_{uv\in A} f(uv) \cdot cost(uv) \f] |
99 \f[ \min\sum_{uv\in A} f(uv) \cdot cost(uv) \f] |
100 \f[ \sum_{uv\in A} f(uv) - \sum_{vu\in A} f(vu) = |
100 \f[ \sum_{uv\in A} f(uv) - \sum_{vu\in A} f(vu) = |
101 sup(u) \quad \forall u\in V \f] |
101 sup(u) \quad \forall u\in V \f] |
102 \f[ lower(uv) \leq f(uv) \leq upper(uv) \quad \forall uv\in A \f] |
102 \f[ lower(uv) \leq f(uv) \leq upper(uv) \quad \forall uv\in A \f] |
103 |
103 |
104 However if the sum of the supply values is zero, then these two problems |
104 However, if the sum of the supply values is zero, then these two problems |
105 are equivalent. |
105 are equivalent. |
106 The \ref min_cost_flow_algs "algorithms" in LEMON support the general |
106 The \ref min_cost_flow_algs "algorithms" in LEMON support the general |
107 form, so if you need the equality form, you have to ensure this additional |
107 form, so if you need the equality form, you have to ensure this additional |
108 contraint manually. |
108 contraint manually. |
109 |
109 |