Author:
Li Hongxia,Tian Shuicheng,Pan Yuan,Zhang Xiao,Yu Xiaochen
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Aggarwal, A.K., Oblak, M., Vemuganti, R.R.: A heuristic solution procedure for multicommodity integer flows. Computer Operation Research 22(10), 1075–1087 (1995)
2. Ahuja, R.K., Kodialam, M., Mishra, A.K., Orlin, J.B.: Computational investigations of maximum flow algorithms. European J. of Operational Research 97, 509–554 (1997)
3. Anderson, R.J., Sctubal, J.C.: Parallel and sequential implementations of maximum flow algorithms. In: Johnson, D.S., McGeoch, C.C. (eds.) Network Flows and Matching: First DIMACS Implementation Challenge. AMS, Providence (1993)
4. Aringhierie, R., Cordone, R.: The Multicommodity Multilevel Bottleneck Assignment Problem. Electronic Notes in Discrete Mathematics 17, 35–40 (2004)
5. Asano, T., Asano, Y.: Recent developments in maximum flow algorithms. Journal of the Operations Research Society of Japan 43(1), 2–31 (2000)