Two commodity flows
暂无分享,去创建一个
We consider biflows in an undirected graph. An existing result gives a sufficient condition (inequality of two cuts) for the existence of an optimal biflow that is integral. This result was used to prove the existence of an optimal biflow that is integral when all but the sink/source nodes are ''even''. We present a counterexample to the first result, prove the second and use the latter to generalize some existing results.
[1] B. Rothschild,et al. Feasibility of Two Commodity Network Flows , 1966, Oper. Res..
[2] S. Vajda,et al. Integer Programming and Network Flows , 1970 .
[3] B. Rothschild,et al. On Two Commodity Network Flows , 1966, Oper. Res..
[4] M. Sakarovitch,et al. Two commodity network flows and linear programming , 1973, Math. Program..