Dae-Sik Choi, In-Chan Choi. On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem. In Danny Z. Chen, D. T. Lee, editors, Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings. Volume 4112 of Lecture Notes in Computer Science, pages 517-526, Springer, 2006. [doi]
Abstract is missing.