Gamst, M.; Petersen, B. - In: European Journal of Operational Research 217 (2012) 2, pp. 278-286
The Multi-Commodity k-splittable Maximum Flow Problem consists in routing as much flow as possible through a capacitated network such that each commodity uses at most k paths and the capacities are satisfied. The problem appears in telecommunications, specifically when considering Multi-Protocol...