Mathematical Programming

, Volume 157, Issue 1, pp 297–342 | Cite as

Single-commodity robust network design with finite and Hose demand sets

  • Valentina Cacchiani
  • Michael Jünger
  • Frauke Liers
  • Andrea Lodi
  • Daniel R. Schmidt
Full Length Paper Series B

Abstract

We study a single-commodity robust network design problem (sRND) defined on an undirected graph. Our goal is to determine minimum cost capacities such that any traffic demand from a given uncertainty set can be satisfied by a feasible single-commodity flow. We consider two ways of representing the uncertainty set, either as a finite list of scenarios or as a polytope. We propose a branch-and-cut algorithm to derive optimal solutions to sRND, built on a capacity-based integer linear programming formulation. It is strengthened with valid inequalities derived as \(\{0,\frac{1}{2}\}\)-Chvátal–Gomory cuts. Since the formulation contains exponentially many constraints, we provide practical separation algorithms. Extensive computational experiments show that our approach is effective, in comparison to existing approaches from the literature as well as to solving a flow based formulation by a general purpose solver.

Keywords

Robust network design Branch-and-cut Cut-set inequalities Polyhedral demand uncertainty Separation under uncertainty 

Mathematics Subject Classification

90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut 90C90 Applications of mathematical programming  90B10 Network models, deterministic 90C27 Combinatorial optimization 90C11 Mixed integer programming 

References

  1. 1.
    Agarwal, Y.K.: k-Partition-based facets of the network design problem. Networks 47(3), 123–139 (2006)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Altın, A., Amaldi, E., Belotti, P., Pınar, M.Ç.: Provisioning virtual private networks under traffic uncertainty. Networks 49(1), 100–115 (2007)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Álvarez-Miranda, E., Cacchiani, V., Dorneth, T., Jünger, M., Liers, F., Lodi, A., Parriani, T., Schmidt, D.R.: Models and algorithms for robust network design with several traffic scenarios. In: Mahjoub, A., Ridha, Markakis, V., Milis, I., Paschos, V.T. (eds.), ISCO 2012, Revised Selected Papers volume 7422 of LNCS, pp. 261–272. Springer (2012)Google Scholar
  4. 4.
    Álvarez-Miranda, E., Cacchiani, V., Lodi, A., Parriani, T., Schmidt, D.R.: Single-commodity robust network design problem: Complexity, instances and heuristic solutions. Eur. J. Oper. Res. 3(238), 711–723 (2014)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Andreello, G., Caprara, A., Fischetti, M.: Embedding {0, 1/2}-cuts in a branch-and-cut framework: a computational study. INFORMS J. Comput. 19, 229–238 (2007)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Atamtürk, A.: On capacitated network design cut-set polyhedra. Math. Program. B 92(3), 425–437 (2002)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Avella, P., Mattia, S., Sassano, A.: Metric inequalities and the network loading problem. In: Bienstock, D., Nemhauser, G. (eds.) Proceedings of the IPCO, volume 3064 of LNCS. pp. 401–421. Springer (2004)Google Scholar
  8. 8.
    Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Barahona, F.: Network design using cut inequalities. SIAM J. Optim. 6(3), 823–837 (1996)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Ben-Ameur, W., Kerivin, H.: Routing of uncertain traffic demands. Optim. Eng. 6(3), 283–313 (2005)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1), 1–13 (1999)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1), 238–252 (1962)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. B 98, 49–71 (2003)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Bienstock, D., Chopra, S., Günlük, O., Tsai, C.-Y.: Minimum cost capacity installation for multicommodity network flows. Math. Program. 81(2), 177–199 (1998)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Bienstock, D., Günlük, O.: Capacitated network design-polyhedral structure and computation. INFORMS J. Comput. 8(3), 243–259 (1996)CrossRefMATHGoogle Scholar
  16. 16.
    Buchheim, C., Liers, F., Sanità, L.: An exact algorithm for robust network design. In: Pahl, J., Reiners, T., Voß, S. (eds.) Proceedings of the INOC, INOC’11, pp. 7–17. Springer (2011)Google Scholar
  17. 17.
    Caprara, A., Fischetti, M.: {0, 1/2}-Chvátal-Gomory cuts. Math. Program. 74(3), 221–235 (1996)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Chekuri, C., Shepherd, B.F., Oriolo, G., Scutellà, M.: Hardness of robust network design. Networks 50(1), 50–54 (2007)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Cherkassky, B.V., Goldberg, A.V.: On implementing push-relabel method for the maximum flow problem. In: Balas, E., Clausen, J. (eds.) Proceedings of the IPCO, volume 920 of LNCS, pp. 157–171. Springer (1995)Google Scholar
  20. 20.
    Christof, T., Löbel, A.: PORTA—POlyhedron Representation Transformation Algorithm. http://typo.zib.de/opt-long_projects/Software/Porta/ (2008)
  21. 21.
    Dorneth, T.: Ein Branch-and-Cut-Verfahren für robustes Netzwerkdesign. Diplomarbeit, Universität zu Köln (2012)Google Scholar
  22. 22.
    Duffield, N.G., Goyal, P., Greenberg, A., Mishra, P., Ramakrishnan, K.K., van der Merwe, J.E.: A flexible model for resource management in virtual private networks. In: Proceedings of the SIGCOMM, SIGCOMM ’99, pp. 95–108. ACM (1999)Google Scholar
  23. 23.
    Fingerhut, J.A., Suri, S., Turner, J.S.: Designing Least-cost nonblocking broadband networks. J. Algorithms 24(2), 287–309 (1997)MathSciNetCrossRefMATHGoogle Scholar
  24. 24.
    Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399–404 (1956)MathSciNetCrossRefMATHGoogle Scholar
  25. 25.
    Gale, D.: A theorem on flows in networks. Pac. J. Math. 7(2), 1073–1082 (1957)MathSciNetCrossRefMATHGoogle Scholar
  26. 26.
    Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35(4), 921–940 (1988)MathSciNetCrossRefMATHGoogle Scholar
  27. 27.
    Gomory, R., Hu, T.: An application of generalized linear programming to network flows. J. SIAM 10(2), 260–283 (1962)MathSciNetMATHGoogle Scholar
  28. 28.
    Gomory, R.E., Hu, T.C.: Synthesis of a communication network. J. SIAM 12(2), 348–369 (1964)MathSciNetMATHGoogle Scholar
  29. 29.
    Johnson, D.S., Minkoff, M., Phillips, S.: The Prize collecting steiner tree problem: theory and practice. In: Proceedings of the SODA, SODA ’00, pp. 760–769. SIAM (2000)Google Scholar
  30. 30.
    Jünger, M., Thienel, S.: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Softw.: Pract. Exper. 30(11), 1325–1352 (2000)MATHGoogle Scholar
  31. 31.
    Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)CrossRefGoogle Scholar
  32. 32.
    Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787–832 (1999)MathSciNetCrossRefMATHGoogle Scholar
  33. 33.
    Magnanti, T.L., Mirchandani, P., Vachani, R.: Modeling and Solving the Capacitated Network Loading Problem. Technical Report OR-239-91, MIT (1991)Google Scholar
  34. 34.
    Magnanti, T.L., Mirchandani, P., Vachani, R.: The convex hull of two core capacitated network design problems. Math. Program. 60(1–3), 233–250 (1993)MathSciNetCrossRefMATHGoogle Scholar
  35. 35.
    Magnanti, T.L., Wong, R.T.: Accelerating benders decomposition: algorithmic enhancement and model selection criteria. Oper. Res. 29(3), 464–484 (1981)MathSciNetCrossRefMATHGoogle Scholar
  36. 36.
    Mattia, S.: The robust network loading problem with dynamic routing. Comput. Optim. Appl. 54, 619–643 (2013)MathSciNetCrossRefMATHGoogle Scholar
  37. 37.
    McCormick, S.T., Rao, M.R., Rinaldi, G.: Easy and difficult objective functions for max-cut. Math. Program. B 94, 459–466 (2003)MathSciNetCrossRefMATHGoogle Scholar
  38. 38.
    Minoux, M.: Optimum synthesis of a network with non-simultaneous multicommodity flow requirements. In: Annals of Discrete Mathematics (11) Studies on Graphs and Discrete Programming, volume 59, pp. 269–277. North-Holland (1981)Google Scholar
  39. 39.
    Mudchanatongsuk, S., Ordóñez, F., Liu, J.: Robust solutions for network design under transportation cost and demand uncertainty. J. Oper. Res. Soc. 59(5), 652–662 (2008)CrossRefMATHGoogle Scholar
  40. 40.
    Orlowski, S., Pióro, M., Tomaszewski, A., Wessäly, R.: SNDlib 1.0–Survivable Network Design Library. In: Proceedings of the INOC 2007, 2007. http://sndlib.zib.de, extended version accepted in Networks (2009)
  41. 41.
    Pesenti, R., Rinaldi, F., Ukovich, W.: An exact algorithm for the min-cost network containment problem. Networks 43(2), 87–102 (2004)MathSciNetCrossRefMATHGoogle Scholar
  42. 42.
    Raack, C., Koster, A.M.C.A., Wessäly, R.: On the Strength of Cut-Based Inequalities for Capacitated Network Design Polyhedra. Technical Report 07-08, ZIB (2007)Google Scholar
  43. 43.
    Sanità, L.: Robust Network Design. Ph.D. Thesis. Università La Sapienza, Roma (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society 2016

Authors and Affiliations

  1. 1.DEIUniversity of BolognaBolognaItaly
  2. 2.Institut für InformatikUniversität zu KölnCologneGermany
  3. 3.Department MathematikFriedrich-Alexander Universität Erlangen-NürnbergErlangenGermany
  4. 4.École Polytechnique de MontréalQuébecCanada

Personalised recommendations