Publication: Research - peer-review › Article in proceedings – Annual report year: 2012
The Multi-Commodity k-splittable Maximum Flow Problem routes flow through a capacitated graph such that each commodity uses at most k paths and such that the total amount of routedflow is maximized. This paper proposes a branch-and-price algorithm based on a route-based Dantzig-Wolfe decomposition, where a route consists of up to k paths. Computational results show that the new algorithm has best performance on seven benchmark instances and is capable of solving two previously unsolved instances.
|Number of pages||4|
|Conference||2nd International Symposium on Combinatorial Optimization (ISCO 2012)|
|Period||17/04/12 → 21/04/12|
- Branch and price, Dantzig-Wolfe Decomposition, Multi-commodity flow, k-splittable, Combinatorial optimization
Loading map data...
No data available