K-splittable delay constrained routing problem: A branch-and-price approach

Networks

Volumn 55, Issue 1, 2010, Pages 33-45

  Truffot, Jérôme ^a   Duhamel, Christophe ^a   Mahey, Philippe ^a  

^a UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

Branch and price; Column generation; Convex constraint; End to end delay; Flow deviation

Indexed keywords

ALGORITHMIC PROCEDURE; AVERAGE DELAY; BRANCH AND PRICE; BRANCH-AND-PRICE ALGORITHMS; BROADBAND COMMUNICATION; COLUMN GENERATION; COMPUTATIONAL SAVINGS; CONVEX CONSTRAINTS; CPU TIME; DELAY CONSTRAINED ROUTING; END TO END DELAY; END-TO-END DELAY BOUNDS; PATH CONTROL; QOS GUARANTEE; ROUTING PROBLEMS; SPLITTABLE FLOWS;

COSTS; OPTIMIZATION; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION SYSTEMS;

QUALITY OF SERVICE;

EID: 73849108116     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20311     Document Type: Article

References (15)

1. A. Atamtürk and D. Rajan, On splittable and unsplittable capacitated network design arc-set polyhedra, Math Program 92 (2002), 315-333.
2. G. Baier, E. Köhler, and M. Skutella, On the k-splittable flow problem, Proceedings of the 10th Annual European Symposium on Algorithms, Springer-Verlag, 2002, pp. 101-103.
3. C. Barnhart, C.A. Hane, and P.H. Vance, Using branch-and-price-and-cut to solve origin-destination integer multicom-modity flow problems, Oper Res 48 (2000), 318-326.
4. S. Beker, D. Kofman, and N. Puech, Off-Line MPLS layout design and reconfiguration: Reducing complexity under dynamic traffic conditions, INOC Conference, Evry(France), 2003, pp. 61-66.
5. W. Ben-Ameur and A. Ouorou, Mathematical models of the delay constrained routing problem, Algorithmic Oper Res 1 (2006), 94-103.
6. D.P. Bertsekas, Nonlinear Programming, 2nd edition, Athena Scientific, Boston, 1999.
7. D. Bienstock, Potential function methods for approximately solving linear programming problems, theory and practice, Kluwer Academics Publishers, Boston, 2002.
8. D. Bienstock and O. Raskina, Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem, Math Program 91 (2002), 479-492.
9. C. Duhamel and P. Mahey, Multicommodity flow problems with a bounded number of paths: A flow deviation approach, Networks 49 (2007), 80-89.
10. L. Fratta, M. Gerla, and L. Kleinrock, The flow deviation method: An approach to store-and-forward communication network design, Networks 3 (1973), 97-133.
11. J.M. Kleinberg, Approximation algorithms for disjoint paths problems, PhD thesis, Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
12. M. Martens and M. Skutella, Flows on few paths: Algorithms and lower bounds, Networks 48 (2006), 68-76.
13. F. Shahrokhi and D.W. Matula, The maximum concurrent flow problem, J ACM 37 (1990), 318-334.
14. J. Truffot and C. Duhamel, A branch and price algorithm for the k-splittable maximum flow problem, LIMOS, Aubière, France, 2006.
15. S. Xu, Smoothing method for minimax problems, Comput Optim Appl 20 (2001), 267-279.