Multiperiod network design with incremental routing

Networks

Volumn 50, Issue 1, 2007, Pages 109-117

  Lardeux, Benoit ^a,b   Nace, Dritan ^b   Geffard, Jérôme ^a  

^a ORANGE LABS   (France)

^b UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

Extreme rays; Incremental flow; Integer programming; Multiperiod network design; Polyhedral study

Indexed keywords

COST FUNCTIONS; INTEGER PROGRAMMING; NETWORK ARCHITECTURE; NETWORK ROUTING; OPTIMIZATION; TELECOMMUNICATION LINKS;

INCREMENTAL FLOW; INCREMENTAL ROUTING; MULTIPERIOD NETWORK DESIGN (MPND) PROBLEMS; TRANSMISSION LAYER;

FIBER OPTIC NETWORKS;

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

References (27)

1. R.K. Ahuja, T. Magnanti, and J.B. Orlin, Networks flows: Theory, algorithms and applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. A. Atamtürk, On capacitated network design cut-set polyhedra, Math Prog B 92 (2002), 425-438.
3. D. Avis, On the extreme rays of the metric cone, Canadian J Math 32 (1980), 126-144.
4. J.F. Benders, Partitioning procedures for solving mixedvariables programming problems, Numerische Mathematik 4 (1962), 238-252.
5. D. Bienstock, S. Chopra, O. Günluk, and C. Tsai, Minimum cost capacity installation for multi-commodity networks, Math Prog 81 (1998), 177-199.
6. D. Bienstock, O. Raskina, I. Saniee, and Q. Wang, Combined network design and multi-period pricing: Modelling, solution techniques, computations, CORC Report 2002-08, Columbia University, New York, 2002.
7. C.G. Chang and B. Gavish, Telecommunications network topological design and capacity expansion problem: Formulations and algorithms, Telecommun Syst 1 (1993), 99-131.
8. C.G. Chang and B. Gavish, Lower bounding procedures for multi-period telecommunications network expansion problems, Oper Res 43 (1995), 43-57.
9. N. Christofides and P. Brooker, Optimal expansion of an existing network, Math Prog 6 (1974), 197-211.
10. G. Dahl and M. Stoer, A polyhedral approach to multi-commodity survivable network design, Numerische Mathematik 68 (1994), 149-167.
11. A. Deza, K. Fukuda, D. Pasechnik, and M. Sato, "On the skeleton of the metric polytope", Lecture Notes in Computer Science, Vol. 2098, J. Akiyama, M. Kano, and M. Urabe (Editors), Springer-Verlag, Berlin, 2001, pp. 125-136.
12. M. Deza and M. Laurent, Geometry of cuts and metrics, Algorithms and combinatorics, Vol. 15, Springer-Verlag, Berlin, 1997.
13. P.J. Doulliez and M.R. Rao, Optimal network capacity planning: A shortest path scheme, Oper Res 23 (1975), 811-818.
14. A. Dutta and J.I. Lim, A multi-period capacity planning model for backbone computer communication networks, Oper Res 40 (1992), 689-705.
15. V. Gabrel, A. Knippel, and M. Minoux, Exact solution of multi-commodity network optimization problems with general step cost functions, Oper Res Lett 25 (1999), 15-23.
16. M. Gondran and M. Minoux, Graphes et algorithmes, Eyrolles, Paris, 1995.
17. M. Iri, On an extension of maximum-flow minimum-cut theorem to multi-commodity flows, J Oper Soc Japan 13 (1971), 129-135.
18. B.W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell Syst Techn J 49 (1970), 291-307.
19. B. Lardeux, Conception de réseaux de télé communications multicouches et évolutifs, Ph.D. Thesis, France Télécom - University of Technology of Compiègne, Compiègne, 2005.
20. M. Laurent and S. Poljak, "The metric polytope," Integer programming and combinatorial optimization, E. Balas, G. Cornuejols, and R. Kannan (Editors), Carnegie Mellon University, GSIA, Pittsburgh, 1983, pp. 107-111.
21. M. Minoux, Network synthesis and dynamic network optimization, Ann Discr Math 31 (1987), 283-324.
22. M. Minoux, Discrete cost multi-commodity network optimization problems and exact solution methods, Ann Oper Res 106(2001), 19-46.
23. G.L. Nemhauser and L.A. Wolsey, Integer and combinatorial optimization, Wiley Interscience Series in Discrete Mathematics and Optimization, New York, 1988.
24. K. Onaga, A multi-commodity flow theorem, Electro Comm Jpn 53A (1970), 16-22.
25. P.D. Seymour, Matroids and multi-commodity flows, Eur J Combinatorics 2 (1981), 257-290.
26. M. Stoer and G. Dahl, A cutting-plane algorithm for multi-commodity survivable network design problems, INFORMS J Comput 10 (1998), 1-11.
27. N. Zadeh, On building minimum cost communication networks over time, Networks 4 (1974), 19-34.