1. Multicommodity maximum flow in planar networks (The D-algorithm approach;Diaz,1972
2. Flows in Networks;Ford,1962
3. Multi-commodity network flows;Hu;Oper. Res.,1963
4. Heuristic algorithms for multi-item multi-stage production scheduling based on the network flow concept;Ibaraki,1985
5. Performance evaluation of the algorithms for some multicommodity flow problem;Ito,1985