1. Alvelos, F., Valério de Carvalho, J.: A local search heuristic based on column generation applied to the binary multicommodity flow problem. In: Proceedings of International Network Optimization Conference, INOC, Citeseer, p. 6 (2007)
2. Alvelos, F., De Carvalho, J.V.: Comparing branch-and-price algorithms for the unsplittable multicommodity flow problem. In: International Network Optimization Conference, pp. 7–12 (2003)
3. Anderson, C.A., Fraughnaugh, K., Parker, M., Ryan, J.: Path assignment for call routing: an application of Tabu search. Ann. Oper. Res. 41(4), 299–312 (1993)
4. Andrews, M., Chuzhoy, J., Guruswami, V., Khanna, S., Talwar, K., Zhang, L.: Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Combinatorica 30(5), 485–520 (2010)
5. Asano, Y.: Experimental evaluation of approximation algorithms for the minimum cost multiple-source unsplittable flow problem. In: ICALP Satellite Workshops, pp. 111–122 (2000)