Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem

European Journal of Operational Research

Volumn 217, Issue 2, 2012, Pages 278-286

  Gamst, M ^a   Petersen, B ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Branch and bound; Combinatorial optimization; Dantzig Wolfe decomposition; Heuristic; k Splittable; Multi commodity flow

Indexed keywords

BRANCH AND BOUNDS; DANTZIG-WOLFE DECOMPOSITION; HEURISTIC; K-SPLITTABLE; MULTI-COMMODITY FLOW;

COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; LINEAR PROGRAMMING;

COMBINATORIAL SWITCHING;

EID: 80755175858     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.10.001     Document Type: Article

References (19)

1. F. Alvelos, J.M.V. de Carvalho, Comparing branch-and-price algorithms for the unsplittable multicommodity flow problem, in: International Network Optimization Conference, 2003, pp. 7-12.
2. G. Baier, E. Kohler, and M. Skutella On the k-splittable flow problem Algorithmica 42 2005 231 248
3. C. Barnhart, C.A. Hane, and P.H. Vance Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems Operations Research 48 2 2000 318 326
4. M. Caramia, and A. Sgalambro An exact approach for the maximum concurrent k-splittable flow problem Optimization Letters 2 2008 251 265 (Pubitemid 351161492)
5. M. Caramia, and A. Sgalambro A fast heuristic algorithm for the maximum concurrent k-splittable flow problem Optimization Letters 4 2010 37 55
6. G.B. Dantzig, and P. Wolfe Decomposition principle for linear programs Operations Research 8 1960 101 111
7. J.W. Evans, and C. Filsfils Deploying IP and MPLS QoS for Multiservice Networks: Theory and Practice 2007 Morgan Kaufman
8. M. Gamst, P.N. Jensen, D. Pisinger, and C.E.M. Plum Two- and three-index formulations of the minimum cost multicommodity k-splittable flow problem European Journal of Operations Research 202 1 2010 82 89
9. J. Kleinberg, Single-source unsplittable flow, in: 37th Annual Symposium on Foundations of Computer Science (FOCS '96), 1996.
10. R. Koch, M. Skutella, I. Spenke, Approximation and complexity of k-splittable flows, in; Approximation and Online Algorithms, Third International Workshop, WAOA, 2005, pp. 244-257. (Pubitemid 43987060)
11. R. Koch, M. Skutella, and I. Spenke Maximum k-splittable s, t-flows Theory of Computing Systems 43 1 2008 1432 4350
12. S.G. Kolliopoulos Minimum-cost single-source 2-splittable flow Information Processing Letters 94 1 2005 15 18 (Pubitemid 40259608)
13. R. Lougee-Heimer The common optimization interface for operations research IBM Journal of Research and Development 47 2003 57 66
14. M. Martens, and M. Skutella Flows on few paths: Algorithms and lower bounds Networks 48 2 2006 68 76 (Pubitemid 44286094)
15. F. Salazar, and M. Skutella Single-source k-splittable min-cost flows Operations research letters 37 2009 71 74
16. J. Truffot, and C. Duhamel A branch and price algorithm for the k-splittable Maximum Flow Problem Discrete Optimization 5 3 2008 629 646
17. J. Truffot, C. Duhamel, P. Mahey, Using branch-and-price to solve multicommodity k-splittable flow problems, in: Proceedings of International Network Optimization Conference (INOC), 2005.
18. J. Truffot, C. Duhamel, and P. Mahey k-Splittable delay constrained routing problem: A branch-and-price approach Networks 55 1 2010 33 45
19. D. Villeneuve, and G. Desaulniers The shortest path problem with forbidden paths European Journal of Operational Research 165 1 2005 97 107 (Pubitemid 40135596)