Affine recourse for the robust network design problem: Between static and dynamic routing

Networks

Volumn 61, Issue 2, 2013, Pages 180-198

  Poss, Michael ^a,b   Raack, Christian ^c  

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

^b UNIVERSITY OF COIMBRA   (Portugal)

^c ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

affine adjustable robust counterparts; affine routing; demand polytope; network design; recourse; robust optimization

Indexed keywords

ADJUSTABLE ROBUST COUNTERPART; AFFINE ROUTING; NETWORK DESIGN; POLYTOPES; RECOURSE; ROBUST OPTIMIZATION;

OPTIMIZATION; ROUTING PROTOCOLS;

DESIGN;

EID: 84873988568     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.21482     Document Type: Conference Paper

References (51)

1. A. Altin, E. Amaldi, P. Belotti, M. Ç. Pinar, Virtual private network design under traffic uncertainty, Electron Notes Discr Math 17 (2004), 19-22.
2. A. Altin, E. Amaldi, P. Belotti, M. Ç. Pinar, Provisioning virtual private networks under traffic uncertainty, Networks 49 (2007), 100-115.
3. A. Altin, H. Yaman, M. Pinar, A hybrid polyhedral uncertainty model for the robust network loading problem, Performance models and risk management in communications systems, N. Gülpinar, P. Harrison, B. Rustem, (Editors), Springer, Springer Heidelberg, 2011, pp. 157-172.
4. A. Altin, H. Yaman, M. Pinar, The robust network loading problem under hose demand uncertainty: Formulation, polyhedral analysis, and computations, INFORMS J Comput 23 (2011), 75-89.
5. D. Applegate, E. Cohen, Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs, Proc Conference Appl, Technologies, Architectures, Protocols Comput Commun (SIGCOM 2003), Karlsruhe, Germany, 2003, pp. 313-324.
6. A. Atamturk, On capacitated network design cut-set polyhedra, Math Program 92 (2002), 425-437.
7. F. Babonneau, O. Klopfenstein, A. Ouorou, J. P. Vial, Robust capacity expansion solutions for telecommunication networks with uncertain demands, Networks; available as Optimization Online preprint 2712 (submitted for publication).
8. W. Ben-Ameur, Between fully dynamic routing and robust stable routing, Proc 6th Int Workshop Design Reliable Commun Networks (DRCN 2007), La Rochelle, France, 2007, pp. 1-6.
9. W. Ben-Ameur, H. Kerivin, New economical virtual private networks, Commun ACM 46 (2003), 69-73.
10. W. Ben-Ameur, H. Kerivin, Routing of uncertain demands, Optim Eng 3 (2005), 283-313.
11. A. Ben-Tal, A. Goryashko, E. Guslitzer, A. Nemirovski, Adjustable robust solutions of uncertain linear programs, Math Program 99 (2004), 351-376.
12. A. Ben-Tal, A. Nemirovski, Robust solutions of uncertain linear programs, Oper Res Lett 25 (1999), 1-13.
13. A. Ben-Tal, A. Nemirovski, Robust solutions of linear programming problems contaminated with uncertain data, Math Program 88 (2000), 411-424.
14. A. Ben-Tal, A. Nemirovski, Robust optimization methodology and applications, Math Program 92 (2002), 453-480.
15. J. Benders, Partitioning procedures for solving mixed-variables programming problems, Numer Math 4 (1962), 238-252.
16. D. Bertsimas, V. Goyal, On the power and limitations of affine policies in two-stage adaptive optimization, Math Program,http://www.springerlink.com/ index/2U016H08582M5024(onlinefirst).
17. D. Bertsimas, M. Sim, Robust discrete optimization and network flows, Math Program 98 (2003), 49-71.
18. D. Bertsimas, M. Sim, The price of robustness, Oper Res 52 (2004), 35-53.
19. D. Bienstock, O. Günlück, Capacitated network design-Polyhedral structure and computation, INFORMS J Comput 8 (1996), 243-259.
20. A. Bley, R. Klaehne, U. Menne, C. Raack, R. Wessaely, Multi-layer network design-A model-based optimization approach, Proc PGTS 2008, Berlin, Germany, 2008, pp. 107-116.
21. C. Chekuri, Routing and network design with robustness to changing or uncertain traffic demands, ACM SIGACT News 38 (2007), 106-129.
22. C. Chekuri, G. Oriolo, M. G. Scutellà, F. B. Shepherd, Hardness of robust network design, Networks 50 (2007), 50-54.
23. X. Chen, Y. Zhang, Uncertain linear programs: Extended affinely adjustable robust counterparts, Oper Res 57 (2009), 1469-1482.
24. A. M. Costa, A survey on Benders decomposition applied to fixed-charge network design problems, Comput. Oper Res 32 (2005), 1429-1450.
25. G. Dahl, M. Stoer, A cutting plane algorithm for multicommodity survivable network design problems, INFORMS J. Comput 10 (1998), 1-11.
26. N. G. Duffield, P. Goyal, A. Greenberg, P. Mishra, K. K. Ramakrishnan, J. E. van der Merive, A flexible model for resource management in virtual private networks, SIGCOMM Comput Commun Rev 29 (1999), 95-108.
27. A. Dwivedi, R. E. Wagner, Traffic model for USA long-distance optical network, Proc Optical Fiber Commun Conference (OFC 2000), Baltimore, MD, 2000, pp. 156-158.
28. A. Frangioni, B. Gendron, 0-1 reformulations of the multicommodity capacitated network design problem, Discr Appl Math 157 (2009), 1229-1241.
29. A. Frangioni, F. Pascali, M. G. Scutellà, Static and dynamic routing under disjoint dominant extreme demands, Oper Res Lett 39 (2011), 36-39.
30. N. Goyal, N. Olver, F. B. Shepherd, Dynamic vs. oblivious routing in network design, Proc ESA 2009, 2009, pp. 277-288.
31. A. Gupta, J. Kleinberg, A. Kumar, R. Rastogi, B. Yener, Provisioning a virtual private network: A network design problem for multicommodity flow, Proc 33rd annual ACM Symp Theory Comput (STOC 2001), Heraklion, Crete, Greece, 2001, pp. 389-398.
32. IBM, IBM-ILOG Cplex Optimizer. webpage. Available at:http://www-01.ibm. com/software/integration/optimization/cplex-optimizer/.
33. M. Iri, On an extension of the maximum-flow minimum-cut theorem to multicommodity flows, J Oper Res Soc Jpn 13 (1971), 129-135.
34. T. Koch, Zimpl user guide, Technical report ZR 01-20, Zuse Institute Berlin (2001).
35. A. M. C. A. Koster, M. Kutschka, C. Raack, Cutset inequalities for robust network design, Proc 5th Int Network Optim Conference (INOC 2011), Hamburg, Germany, Network Optimization-Lecture Notes in Computer Science, Vol. 6701, Springer, Springer Heidelberg, 2011, pp. 118-123.
36. A. M. C. A. Koster, M. Kutschka, C. Raack, Robust network design: Formulations, valid inequalities, and computations, ZIB report 11-34, Zuse Institute Berlin, 2011.
37. A. Lisser, A. Ouorou, J. P. Vial, J. Gondzio, Capacity planning under uncertain demand in telecommunication networks, Papers 99.13, Ecole des Hautes Etudes Commerciales, Universite de Geneve (1999).
38. S. Mattia, The robust network loading problem with dynamic routing, Technical report n. 3 (2010), La Sapienza, University of Rome.
39. S. Mudchanatongsuk, F. Ordonez, J. Liu, Robust solutions for network design under transportation cost and demand uncertainty, J Oper Res Soc 59 (2008), 552-562.
40. K. Onaga, O. Kakusho, On feasibility conditions of multicommodity flows in networks, Trans Circuit Theory 18 (1971), 425-429.
41. F. Ordõñez, J. Zhao, Robust capacity expansion of network flows, Networks 50 (2007), 136-145.
42. G. Oriolo, Domination between traffic matrices, Math Oper Res 33 (2008), 91-96.
43. S. Orlowski, M. Piõro, A. Tomaszewski, R. Wessäly, SNDlib 1.0-Survivable Network Design Library, Networks 55 (2010), 276-286; Available at:http://sndlib.zib.de.
44. A. Ouorou, Affine decision rules for tractable approximations to robust capacity planning in telecommunications, Proc 5th Int Network Optim Conference (INOC 2011), Hamburg, Germany, Network Optimization-Lecture Notes in Computer Science, Vol. 6701, Springer, Springer Heidelberg, 2011, pp. 277-282.
45. A. Ouorou, J. P. Vial, A model for robust capacity planning for telecommunications networks under demand uncertainty, Proc 6th Int Workshop Design Reliable Commun Networks (DRCN 2007), 2007, pp. 1-4.
46. M. Poss, C. Raack, Affine recourse for the robust network design problem: Between static and dynamic routing, Proc 5th Int Network Optim Conference (INOC 2011), Hamburg, Germany, Network Optimization-Lecture Notes in Computer Science, Vol. 6701, Springer, Springer Heidelberg, 2011, pp. 150-155.
47. C. Raack, A. M. C. A. Koster, S. Orlowski, R. Wessäly, On cut-based inequalities for capacitated network design polyhedra, Networks 57 (2011), 141-156.
48. M. G. Scutellà, On improving optimal oblivious routing, Oper Res Lett 37 (2009), 197-200.
49. M. G. Scutellà, Hardness of some optimal oblivious routing generalizations, Technical report TR-10-05 (2010), Universitá di Pisa.
50. A. L. Soyster, Convex programming with set-inclusive constraints and applications to inexact linear programming, Oper Res 21 (1973), 1154-1157.
51. Y. Zhang, M. Roughan, N. Duffield, A. Greenberg, Fast accurate computation of large-scale IP traffic matrices from link loads, Proc ACM SIGMETRICS, 2003, pp. 206-217.