Benders decomposition for the hop-constrained survivable network design problem

INFORMS Journal on Computing

Volumn 25, Issue 1, 2013, Pages 13-26

  Botton, Quentin ^a   Fortz, Bernard ^b   Gouveia, Luis ^c   Poss, Michael ^b  

^a LOUVAIN SCHOOL OF MANAGEMENT   (Belgium)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c UNIVERSITY OF LISBON   (Portugal)

Author keywords

Benders decomposition; Branch and cut algorithm; Edge disjoint paths; Hop constrained paths; Survivable network

Indexed keywords

BENDERS DECOMPOSITION; BRANCH-AND-CUT ALGORITHMS; EDGE-DISJOINT PATHS; HOP-CONSTRAINED PATHS; SURVIVABLE NETWORKS;

GRAPH THEORY;

ALGORITHMS;

EID: 84877975414     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1110.0472     Document Type: Article

References (46)

1. Achterberg, T. 2009. SCIP: Solving constraint integer programs. Math. Programming Comput. 1(1) 1-41.
2. Achterberg, T., C. Raack. 2010. The MCF-separator - Detecting and exploiting multi-commodity flows in MIPs. Math. Programming C 2(2) 125-165.
3. Bai, L., P. A. Rubin. 2009. Combinatorial Benders cuts for the minimum toll booth problem. Oper. Res. 57(6) 1510-1522.
4. Balakrishnan, A., K. Altinkemer. 1992. Using a hop-constrained model to generate alternative communication network design. ORSA J. Comput. 4(2) 192-205.
5. Benders, J. 1962. Partitioning procedures for solving mixedvariables programming problems. Numerische Mathematik 4 238-252.
6. Birge, J. R., F. Louveaux. 2008. Introduction to Stochastic Programming, 2nd ed. Springer-Verlag, New York.
7. Bley, A. 1997. Node-disjoint length-restricted paths. Master's thesis, Technische Universität Berlin, Berlin.
8. Bley, A., J. Neto. 2010. Approximability of 3- and 4-hop bounded disjoint paths problems. F. Eisenbrand, F. B. Shepherd, eds. Proc. Integer Programming Combinat. Optim. (IPCO 2010). Lecture Notes in Computer Science, Vol. 6080. Springer, Berlin, 205-218.
9. Carøe, C. C., J. Tind. 1998. L-shaped decomposition of two-stage stochastic programs with integer recourse. Math. Programming 83(1-3) 451-464. (Pubitemid 128431424)
10. Codato, G., M. Fischetti. 2006. Combinatorial Benders' cuts for mixed-integer linear programming. Oper. Res. 54(4) 756-766. (Pubitemid 44521585)
11. Costa, A. M. 2005. A survey on Benders decomposition applied to fixed-charge network design problems. Comput. Oper. Res. 32(6) 1429-1450.
12. Dahl, G. 1999. Notes on polyhedra associated with hop-constrained walk polytopes. Oper. Res. Lett. 25(2) 97-100.
13. Dahl, G., L. Gouveia. 2004. On the directed hop-constrained shortest path problem. Oper. Res. Lett. 32(1) 15-22.
14. Dahl, G., B. Johannessen. 2004. The 2-path network problem. Networks 43(3) 190-199. (Pubitemid 38700756)
15. Dahl, G., M. Stoer. 1998. A cutting plane algorithm for multicommodity survivable network design problems. INFORMS J. Comput. 10(1) 1-11. (Pubitemid 128666513)
16. Dahl, G., N. Foldnes, L. Gouveia. 2004. A note on hop-constrained walk polytopes. Oper. Res. Lett. 32(4) 345-349.
17. Dahl, G., D. Huygens, A. R. Mahjoub, P. Pesneau. 2006. On the k edge-disjoint 2-hop-constrained paths polytope. Oper. Res. Lett. 34(5) 577-582. (Pubitemid 43851078)
18. Diarrassouba, I. 2009. Survivable network design problems with high survivability requirements. Ph.D. thesis, Université Blaise Pascal - Clermond-Ferrand II, Auvergne, France.
19. Dolan, E. D., J. J. Moré. 2002. Benchmarking optimization software with performance profiles. Math. Programming Ser. A 91(2) 201-213. (Pubitemid 44744777)
20. Fischetti, M., D. Salvagnin, A. Zanette. 2010. A note on the selection of Benders' cuts. Math. Programming 124(1-2) 175-182.
21. Fortz, B. 2000. Design of Survivable Networks with Bounded Rings. Network Theory and Applications, Vol. 2. Kluwer Academic Publishers, Dordrecht, The Netherlands.
22. Fortz, B., M. Labbé. 2002. Polyhedral results for two-connected networks with bounded rings. Math. Programming 93(1) 27-54. (Pubitemid 44744752)
23. Fortz, B., M. Labbé. 2004. Two-connected networks with rings of bounded cardinality. Comput. Optim. Appl. 27(2) 123-148.
24. Fortz, B., M. Poss. 2009. An improved Benders decomposition applied to a multi-layer network design problem. Oper. Res. Lett. 37(5) 359-364.
25. Fortz, B., A. R. Mahjoub, S. T. McCormick, P. Pesneau. 2006. Twoedge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut. Math. Programming 105(1) 85-111. (Pubitemid 41705519)
26. Gouveia, L. 1996. Multicommodity flow models for spanning trees with hop constraints. Eur. J. Oper. Res. 95(1) 178-190. (Pubitemid 126391980)
27. Gouveia, L. 1998. Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints. INFORMS J. Comput. 10(2) 180-188. (Pubitemid 128669126)
28. Gouveia, L., T. L. Magnanti. 2003. Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. Networks 41(3) 159-173.
29. Gouveia, L., P. F. Patrício, A. F. Sousa. 2006. Telecommunications planning: Innovations in pricing, network design and management. Compact Models for Hop-Constrained Node Survivable Network Design. Springer, New York, 167-180.
30. Gouveia, L., P. F. Patrício, A. F. Sousa. 2008. Hop-contrained node survivable network design: An application to MPLS over WDM. Networks Spatial Econom. 8(1) 3-21.
31. Gouveia, L. E., P. F. Patrício, A. F. de Sousa, R. Valadas. 2003. MPLS over WDM network design with packet level QoS constraints based on ILP models. Proc. IEEE INFOCOM, Vol. 1. IEEE, Piscataway, NJ, 576-586.
32. Grötschel, M., C. L. Monma, M. Stoer. 1992. Facets for polyhedra arising in the design of communication networks with lowconnectivity constraints. SIAM J. Optim. 2(3) 274-504.
33. Hooker, J. N. 2000. Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley-Interscience, New York.
34. Huygens, D., A. R. Mahjoub. 2007. Integer programming formulations for the two 4-hop-constrained paths problem. Networks 49(2) 135-144. (Pubitemid 46931770)
35. Huygens, D., A. R. Mahjoub, P. Pesneau. 2004. Two edge-disjoint hop-constrained paths and polyhedra. SIAM J. Discrete Math. 18(2) 287-312. (Pubitemid 40672769)
36. Huygens, D., M. Labbé, A. R. Mahjoub, P. Pesneau. 2007. The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut. Networks 49(1) 116-133. (Pubitemid 46485352)
37. IBM-ILOG. 2009. IBM-ILOG CPLEX. Retrieved August 23, 2011, http://www.ilog.com/products/cplex/. IBM, Armonk, NY.
38. Itaí, A., Y. Perl, Y. Shiloach. 1982. The complexity of finding maximum disjoint paths with length constraints. Networks 12(3) 277-286. (Pubitemid 13491782)
39. Kerivin, H., A. R. Mahjoub. 2005. Design of survivable networks: A survey. Networks 46(1) 1-21. (Pubitemid 41092973)
40. Ljubic, I., P. Putz, J. J. Salazar. 2009. Exact approaches to the singlesource network loading problem. Technical Report 2009-05, University of Vienna, Vienna.
41. Magnanti, T. L., S. Raghavan. 2005. Strong formulations for network design problems with connectivity requirements. Networks 45(2) 61-79. (Pubitemid 40304384)
42. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley-Interscience, New York.
43. Orlowski, S., M. Pióro, A. Tomaszewski, R. Wessäly. 2010. SNDlib 1.0 - Survivable network design library. Networks 55(3) 276-286.
44. Pirkul, H., S. Soni. 2003. New formulations and solution procedures for the hop constrained network design problem. Eur. J. Oper. Res. 148(1) 126-140.
45. Raghavan, S. 1995. Strong formuations for network design problems with connectivity requirements. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge.
46. Stoer, M., ed. 1992. Design of Survivable Networks. Lecture Notes in Mathematics, Vol. 1531. Springer, Berlin.