Robust network design: Formulations, valid inequalities, and computations

Networks

Volumn 61, Issue 2, 2013, Pages 128-149

  Koster, Arie M C A ^a,b   Kutschka, Manuel ^a   Raack, Christian ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

network design; polyhedral combinatorics; robust optimization

Indexed keywords

CUT-SET; EXTRA VARIABLES; MATHEMATICAL FORMULATION; MIXED-INTEGER PROGRAMMING; NETWORK DESIGN; NETWORK PLANNING; POLYHEDRAL COMBINATORICS; REAL NETWORKS; ROBUST FORMULATIONS; ROBUST NETWORK; ROBUST OPTIMIZATION; SUPPORT NETWORKS; TELECOMMUNICATION NETWORK DESIGN; TRAFFIC MEASUREMENTS; TRAFFIC UNCERTAINTIES; TRAFFIC VOLUMES; VALID INEQUALITY;

INTEGER PROGRAMMING; TELECOMMUNICATION NETWORKS;

OPTIMIZATION;

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

References (63)

1. Abilene Internet2 Network, Available at: http://internet2.edu/network/. AccessedonJanuary7, 2013.
2. Y.K. Agarwal, k-partition-based facets of the network design problem, Networks 47 (2006), 123-139.
3. A. Altin, E. Amaldi, P. Belotti, C. M.Pinar, Provisioning virtual private networks under traffic uncertainty, Networks 49 (2007), 100-155.
4. A. Altin, H. Yaman, M.C. Pinar, A hybrid polyhedral uncertainty model for the robust network loading problem, Technical Report, Bilkent University, 2009.
5. A. Altin, H. Yaman, M.C. Pinar, The robust network loading problem under polyhedral demand uncertainty: Formulation, polyhedral analysis, and computations, INFORMS J Comput 23 (2011), 75-89.
6. A. Atamtürk, Flow pack facets of the single node fixed charge flow polytope, Oper Res 29 (2001), 107-114.
7. A. Atamtürk, On capacitated network design cut-set polyhedra, Math Program 92 (2002), 425-437.
8. A. Atamtürk, M. Zhang, Two-stage robust network flow and design under demand uncertainty, Oper Res 55 (2007), 662-673.
9. P. Avella, S. Mattia, A. Sassano, Metric inequalities and the network loading problem, Discr Optim 4 (2006), 103-114.
10. P. Belotti, A. Capone, G. Carello, Multi-layer MPLS network design: The impact of statistical multiplexing, Comput Networks 52 (2008), 1291-1307.
11. P. Belotti, K. Kompella, L. Noronha, A comparison of OTN and MPLS networks under traffic uncertainty, Working Paper (2011), available at: http://myweb.clemson.edu/pbelott/papers/robust-opt-network-design.pdf. AccessedonJanuary7, 2013.
12. W. Ben-Ameur, Between fully dynamic routing and robust stable routing, Proc 6th Int Workshop Design of Reliable Commun Networks (DRCN), La Rochelle, France, 2007.
13. W. Ben-Ameur, H. Kerivin, Routing of uncertain demands, Optim Eng 3 (2005), 283-313.
14. A. Ben-Tal, L.E. Ghaoui, A. Nemirovski, Robust optimization, Princeton University Press, Princeton, New Jersey, 2009.
15. A. Ben-Tal, A. Goryashko, E. Guslitzer, A. Nemirovski, Adjustable robust solutions of uncertain linear programs, Math Program 99 (2004), 351-376.
16. A. Ben-Tal, A. Nemirovski, Robust solutions of uncertain linear programs, Oper Res Lett 25 (1999), 1-14.
17. A. Ben-Tal, A. Nemirovski, Robust solutions of linear programming problems contaminated with uncertain data, Math Program 88 (2000), 411-424.
18. A. Ben-Tal, A. Nemirovski, Robust optimization-methodology and application, Math Program 92 (2002), 453-480.
19. D. Bertsimas, M. Sim, Robust discrete optimization and network flows, Math Program 98 (2003), 49-71.
20. D. Bertsimas, M. Sim, The price of robustness, Oper Res 52 (2004), 35-53.
21. D. Bertsimas, A. Thiele, A robust optimization approach to inventory theory, Oper Res 54 (2006), 150-168.
22. D. Bienstock, S. Chopra, O. Günlük, C.Y. Tsai, Minimum cost capacity installation for multicommodity network flows, Math Program 81 (1998), 177-199.
23. D. Bienstock, O. Günlük, Capacitated network design-polyhedral structure and computation, INFORMS J Comput 8 (1996), 243-259.
24. A. Bley, U. Menne, R. Klähne, C. Raack, R. Wessäly, Multi-layer network design-a model-based optimization approach, Proc Polish-German Teletraffic Symp (PGTS), Berlin, Germany, 2008, pp. 107-116.
25. C. Chekuri, G. Oriolo, M.G. Scutellá, F.B. Shepherd, Hardness of robust network design, Networks 50 (2007), 50-54.
26. S. Chopra, I. Gilboa, S.T. Sastry, Source sink flows with capacity installation in batches, Discr Appl Math 86 (1998), 165-192.
27. G.B. Dantzig, Linear programming under uncertainty, Manage Sci 1 (1955), 197-206.
28. Deutsche Forschungsnetz (DFN), available at: http://www.dfn.de. AccessedonJanuary7, 2013.
29. N.G. Duffield, P. Goyal, A.G. Greenberg, P.P. Mishra, K.K. Ramakrishnan, J.E. vander Merive, A flexible model for resource management in virtual private networks, Proc ACM SIGCOMM, Cambridge, MA, 1999, pp. 95-108.
30. A. Dwivedi, R.E. Wagner, Traffic model for USA long distance optimal network, Proc Optical Fiber Commun Conference (OFC), Baltimore, MD, 2000, pp. 156-158.
31. J. Fingerhut, S. Suri, J. Turner, Designing least-cost nonblocking broadband networks, J Algorithms 24 (1997), 287-309.
32. M. Fischetti, M. Monaci, Cutting planes for uncertain (integer) linear programs, Math Program Comput 4 (2012), 239-273.
33. F. Grandoni, V. Kaibel, G. Oriolo, M. Skutella, A short proof of the VPN tree routing conjecture on ring networks, Oper Res Lett 36 (2008), 361-365.
34. Z. Gu, G.L. Nemhauser, M.W.P. Savelsbergh, Lifted flow cover inequalities for mixed 0-1 integer programs, Math Program 85 (1999), 436-467.
35. Z. Gu, G.L. Nemhauser, M.W.P. Savelsbergh, Sequence independent lifting in mixed integer programming, J Combinatorial Optim 4 (2000), 109-129.
36. O. Günlük, A branch and cut algorithm for capacitated network design problems, Math Program 86 (1999), 17-39.
37. C.A.J. Hurkens, J.C.M. Keijsper, L. Stougie, Virtual private network design: A proof of the tree routing conjecture on ring networks, SIAM J Discr Math 21 (2007), 482-503.
38. F. Idzikowski, S. Orlowski, C. Raack, H. Woesner, A. Wolisz, Dynamic routing at different layers in IP-over-WDM networks-maximizing energy savings, Optical Switching Networking, Special Issue Green Commun 8 (2011), 181-2000.
39. I. ILOG, CPLEX version 12.1, available at: http://www-01.ibm.com/ software/integration/optimization/cplex-optimization-studio.AccessedonJanuary7, 2013.
40. O. Klopfenstein, D. Nace, Valid inequalities for a robust knapsack polyhedron-Application to the robust bandwidth packing problem, Networks (2012), 59-72.
41. A.M. Koster, M. Kutschka, C. Raack, Towards robust network design using integer linear programming techniques, Proc 6th Conference Next Generation Internet (NGI), Paris, France, 2010, pp. 1-8.
42. A.M. Koster, M. Kutschka, C. Raack, Cutset inequalities for robust network design, Proc Int Network Optimization Conference (INOC), Hamburg, Germany, 2011, pp. 118-123.
43. A.M. Koster, M. Kutschka, C. Raack, On the robustness of optimal network designs, Proc IEEE Int Conference Commun (ICC), Kyoto, Japan, 2011, pp. 1-5.
44. B. Lardeux, D. Nace, J. Geffard, Multiperiod network design with incremental routing, Networks 50 (2007), 109-117.
45. Q. Louveaux, L.A. Wolsey, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, 4OR 1 (2003), 173-207.
46. T.L. Magnanti, P. Mirchandani, Shortest paths, single origin-destination network design and associated polyhedra, Networks 33 (1993), 103-121.
47. T.L. Magnanti, P. Mirchandani, R. Vachani, Modelling and solving the two-facility capacitated network loading problem, Oper Res 43 (1995), 142-157.
48. S. Mattia, The robust network loading problem with dynamic routing, Technical Report 3, Università di Roma la Sapienza, 2010.
49. A.J. Miller, L.A. Wolsey, Tight formulations for some simple mixed integer programs and convex objective integer programs, Math Program 98 (2003), 73-88.
50. S. Mudchanatongsuk, F. Ordõnez, J. Liu, Robust solutions for network design under transportation cost and demand uncertainty, J Oper Res Soc 59 (2008), 652-662.
51. G.L. Nemhauser, L.A. Wolsey, Integer and combinatorial optimization, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York, 1988.
52. NOBEL-Next generation Optical networks for Broadband European Leadership, available at: http://www.ist-nobel.org.AccessedonJanuary7, 2013.
53. G. Oriolo, Domination between traffic matrices, Math Oper Res 33 (2008), 91-96.
54. S. Orlowski, R. Wessäly, M. Piõro, A. Tomaszewski, SNDlib 1.0-Survivable network design library, Networks 55 (2010), 276-286.
55. A. Ouorou, J.P. Vial, A model for robust capacity planning for telecommunications networks under demand uncertainty, Proc 6th Int Workshop Design of Reliable Commun Networks (DRCN), La Rochelle, France, 2007.
56. M. Poss, C. Raack, Affine recourse for the robust network design problem: Between static and dynamic routing, ZIB Report 11-03, Zuse Institute Berlin, Germany, 2011.
57. C. Raack, A.M. Koster, S. Orlowski, R. Wessäly, On cut-based inequalities for capacitated network design polyhedra, Networks 57 (2011), 141-156.
58. M.G. Scutellá, On improving optimal oblivious routing, Oper Res Lett 37 (2009), 197-200.
59. SNDlib-Survivable Network Design Library, available at: http://sndlib.zib.de.AccessedonJanuary7, 2013.
60. A.L. Soyster, Convex programming with set-inclusive constraints and applications to inexact linear programming, Oper Res 21 (1973), 1154-1157.
61. S.E. Terblanche, R. Wessäly, J.M. Hattingh, Lagrangian relaxation as a solution approach to solving the survivable multi-hour network design problem, Proc South African Telecommuniations Networks Appl Conference (SATNAC), Sugar Beach Resort, Mauritius, 2007.
62. S. Uhlig, B. Quoitin, J. Lepropre, S. Balon, Providing public intradomain traffic matrices to the research community, ACM SIGCOMM Comput Commun Review 36 (2006), 83-86.
63. Y. Zhang, 6 months of Abilene traffic matrices, available at: http://www.cs.utexas.edu/∼yzhang/research/AbileneTM.AccessedonJanuary7, 2013.