Two- and three-index formulations of the minimum cost multicommodity k-splittable flow problem

European Journal of Operational Research

Volumn 202, Issue 1, 2010, Pages 82-89

  Gamst, Mette ^b   Neergaard Jensen, Peter ^a   Pisinger, David ^b   Plum, Christian ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Decomposition; Multicommodity flow; Network flows; Transportation

Indexed keywords

BRANCH AND PRICE; CAPACITY RESTRICTION; EFFICIENT ROUTING; FEASIBLE SOLUTION; INDEX ALGORITHMS; K-PATHS; MAXIMUM FLOWS; MINIMUM COST; MULTI-COMMODITY; MULTICOMMODITY FLOW; NETWORK FLOWS; NP-HARD; RUNNING TIME; SPLITTABLE FLOWS; TEST INSTANCES; TRANSPORTATION PROBLEM;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; LINEAR PROGRAMMING;

COSTS;

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

References (22)

1. Ahuja R.K., Magnanti T.L., and Orling J.B. Network Flows (1993), Prentice-Hall, Inc.
2. F.Alvelos. Branch-and-Price and Multicommodity Flows. Ph.D. Thesis, Universidade do Minho, 2005. Available from .
3. D. Applegate, R. Bixby, V. Chvatal, B. Cook, Finding Cuts in the TSP, Technical Report 95-05, Center for Discrete Mathematics and Theoretical Computer Science (DIMACS), Rutgers University, Piscatawy, NJ, 1995.
4. G. Baier, E. Köhler, M. Skutella, On the k-splittable flow problem, in: 10th Annual European Symposium on Algorithms, 2002, pp. 101-113.
5. Barnhart C., Hane C.A., and Vance P.A. Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research 48 (2000) 318-326
6. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introductions to Algorithms. second ed. (2001), MIT Press and McGraw-Hill
7. Dantzig G.B., and Wolfe P. Decomposition principle for linear programs. Operations Research 8 (1960) 101-111
8. Ford L.R., and Fulkerson D.R. A suggested computation for maximal multi-commodity network flows. Management Science 5 (1958) 97-101
9. M. Gamst, P.N. Jensen, C. Plum, Multicommodity k-Splittable Flow Problemet Løst Med Branch-and-price, Report, Department of Computer Science, University of Copenhagen (DIKU), Denmark, 2006.
10. Handler G., and Zang I. A dual algorithm for the constrained shortest path problem. Networks 10 (1980) 293-310
11. Jepsen M., Petersen B., Spoorendonk S., and Pisinger D. Introducing subset row inequalities in a branch-and-cut-and-price algorithm for the vehicle routing problem with time windows. Operations Research 56 (2008) 497-511
12. A. Kamath, O. Palmon, Improved interior point algorithms for exact and approximate solution of multicommodity flow problems, in: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995.
13. J.M. Kleinberg, Approximation algorithms for disjoint paths problems, Ph.D. Thesis, MIT, Cambridge, MA, 1996.
14. R. Koch, M. Skutella, I. Spenke, Approximation and complexity of k-splittable flows, Approximation and Online Algorithms, in: Third International Workshop, WAOA, 2005, pp. 244-257.
15. Koch R., Skutella M., and Spenke I. Maximum k-splittable s,t-flows. Theory of Computing Systems 43 1 (2008) 1432-4350
16. Larsson T., and Yuan D. An augmented lagrangian algorithm for large scale multicommodity routing. Computational Optimization and Applications 27 (2004) 187-215
17. Lougee-Heimer R. The common optimization interface for operations research. IBM Journal of Research and Development 47 (2003) 57-66
18. J.T. Robacker, Concerning multicommodity networks, Technical Report RM-1799, The RAND Corporation, Santa Monica, California, 1956.
19. Truffot J., and Duhamel C. A branch-and-price algorithm for the k-splittable maximum flow problem. Discrete Optimization 5 3 (2008) 629-646
20. J. Truffot, C. Duhamel, P. Mahey, Branch-and-price pour le problème du multiflot k-sèparable de coût minimal, in: LIMOS, UMR 6158 - CNRS, ROADEF'05, 2005.
21. J. Truffot, C. Duhamel, P. Mahey, Using branch-and-price to solve multicommodity k-splittable flow problems, in: Proceedings of the International Network Optimization Conference (INOC), 2005.
22. Villeneuve D., and Desaulniers G. The shortest path problem with forbidden paths. European Journal of Operational Research 165 1 (2005) 97-107