Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem

INFORMS Journal on Computing

Volumn 26, Issue 4, 2014, Pages 645-657

  Gendron, Bernard ^a   Lucena, Abilio ^b   Da Cunha, Alexandre Salles ^c   Simonetti, Luidi ^d  

^a INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^c FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^d FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

Benders decomposition; Branch and cut; Connected dominating sets; Valid inequalities

Indexed keywords

AD HOC NETWORKS; GRAPH ALGORITHMS; INTEGER PROGRAMMING; MOBILE TELECOMMUNICATION SYSTEMS; STOCHASTIC PROGRAMMING;

BENDERS DECOMPOSITION; BENDERS DECOMPOSITION ALGORITHM; BRANCH AND CUT; COMPUTATIONAL RESULTS; CONNECTED DOMINATING SET; MINIMUM CONNECTED DOMINATING SET; STAND-ALONE VERSION; VALID INEQUALITY;

ITERATIVE METHODS;

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

References (31)

1. Asavathiratham C, Roy S, Lesieutre B, Verghese G (2001) The influence model. IEEE Control Systems 21(6):52-64.
2. Balasundaram B, Butenko S (2006) Graph domination, coloring and cliques in telecommunications. Handbook of Optimization in Telecommunication (Springer, New York), 865-890.
3. Berge C (1973) Graphs and Hypergraphs (North Holland, Amsterdam).
4. Borndörfer R (1998) Aspects of set packing, partitioning and covering. Ph.D. thesis, Konrad-Zuse-Zentrum fur Informationstechnik, Berlin.
5. Chen S, Ljubić I, Raghavan S (2010) The regenerator location problem. Networks 55(3):205-220.
6. Chopra S, Rao MR (1994a) The Steiner tree problem I: Formulations, compositions and extensions of facets. Math. Programming 64(1- 3):209-229.
7. Chopra S, Rao MR (1994b) The Steiner tree problem II: Properties and classes of facets. Math. Programming 64(1-3):231-246.
8. Codato G, Fischetti M (2006) Combinatorial Benders' cuts for mixedinteger linear programming. Oper. Res. 54(4):756-766.
9. Cooper C, Klasing R, Zito M (2005) Lower bounds and algorithms for dominating sets in Web graphs. Internet Math. 2(3):275-300.
10. Domingos P, Richardson M (2001) Mining the network value of customers. Proc. Seventh Internat. Conf. Knowledge Discovery Data Mining (ACM, New York).
11. Eubank S, Guclu H, Kumar VSA, Marathe MV, Srinivasan A, Toroczkai Z, Wang N (2004) Modelling disease outbreaks in realistic urban social networks. Nature 429(6988):180-184.
12. Fan N, Watson JP (2012) Solving the connected dominating set problem and power dominating set problem by integer programming. Combinatorial Optimization and Applications, Lecture Notes in Computer Science, Vol. 7402 (Springer, Berlin), 371-383.
13. Fernau H, Kneis J, Kratsch D, Langer A, Liedlo M, Raible D, Rossmanith P (2011) An exact algorithm for the maximum leaf spanning tree problem. Theor. Comput. Sci. 412(45):6290-6302.
14. Fujie T (2003) An exact algorithm for the maximum leaf spanning tree problem. Comput. Oper. Res. 30(13):1931-1944.
15. Fujie T (2004) The maximum-leaf spanning tree problem: Formulations and facets. Networks 43(4):212-223.
16. Goldenberg J, Libai B, Muller E (2001) Using complex systems analysis to advance marketing theory development. Acad. Marketing Sci. Rev. 9:1-19.
17. Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20(4):374-387.
18. Hooker JN, Ottosson G (2003) Logic-based Benders decomposition. Math. Programming 96(1):33-60.
19. Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. P. Amer. Math. Soc. 7: 48-50.
20. Liu CL (1968) Introduction to Combinatorial Mathematics (McGraw-Hill, New York).
21. Lucena A, Maculan N, Simonetti L (2010) Reformulation and solution algorithms for the maximum leaf spanning tree problem. Comput. Management Sci. 7(3):289-311.
22. Marathe MV, Breu H, Hunt III HB, Ravi SS, Rosenkrantz DJ (1995) Simple heuristics for unit disc graphs. Networks 25(2):59-68.
23. Martin RK (1991) Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10:119-128.
24. Milenković T, Memišević V, Bonato A, Pržulj N (2011) Dominating biological networks. PLOS ONE 6(8).
25. Padberg MW, Wolsey L (1983) Trees and cuts. Ann. Discrete Math. 17:511-517.
26. Rogers EM (2003) Diffusion of Innovations (Free Press, New York).
27. Simonetti L, da Cunha AS, Lucena A (2011) The minimum connected dominating set problem: Formulation, valid inequalities and branch-and-cut algorithm. Pahl J, Reiners T, Vo. S, eds. Network Optim.-Proc. 5th Internat. Network Optim. Conf., Hamburg, Lecture Notes in Computer Science, Vol. 6701 (Springer, Berlin), 162-169.
28. Stanley EA (2006) Social networks and mathematical modelling. Connections 27(1):43-49.
29. Valente T (1995) Network Models of the Diffusion of Innovations (Hampton Press, Cresskill, NJ).
30. Wang F, Du H, Camachoa E, Xua K, Lee W, Shi Y, Shan S (2011) On positive influence dominating sets in social networks. Theoret. Comput. Sci. 412(3):265-269.
31. Xie L, Zhu S (2007) A feasibility study on defending against ultra-fast topological worms. Proc. Seventh IEEE Internat. Conf. Peer-to-Peer Comput. (P2P'07) (IEEE, Piscataway, NJ), 61-70.