The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches

  • Pedro Pinacho Davidson
  • Christian BlumEmail author
  • José A. Lozano
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10197)


This work deals with the so-called weighted independent domination problem, which is an NP-hard combinatorial optimization problem in graphs. In contrast to previous theoretical work from the literature, this paper considers the problem from an algorithmic perspective. The first contribution consists in the development of an integer linear programming model and a heuristic that makes use of this model. Second, two greedy heuristics are proposed. Finally, the last contribution is a population-based iterated greedy algorithm that takes profit from the better one of the two developed greedy heuristics. The results of the compared algorithmic approaches show that small problem instances based on random graphs are best solved by an efficient integer linear programming solver such as CPLEX. Larger problem instances are best tackled by the population-based iterated greedy algorithm. The experimental evaluation considers random graphs of different sizes, densities, and ways of generating the node and edge weights.


  1. 1.
    Chang, S.C., Liu, J.J., Wang, Y.L.: The weighted independent domination problem in series-parallel graphs. In: Proceedings of ICS 2014 - The International Computer Symposium of Intelligent Systems and Applications, vol. 274, pp. 77–84. IOS Press (2015)Google Scholar
  2. 2.
    Chang, G.J.: The weighted independent domination problem is NP-complete for chordal graphs. Discrete Appl. Math. 143(1), 351–352 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Wang, Y., Li, R., Zhou, Y., Yin, M.: A path cost-based GRASP for minimum independent dominating set problem. Neural Comput. Appl. (2016, in press)Google Scholar
  4. 4.
    Potluri, A., Singh, A.: Hybrid metaheuristic algorithms for minimum weight dominating set. Appl. Soft Comput. 13(1), 76–88 (2013)CrossRefGoogle Scholar
  5. 5.
    Chaurasia, S.N., Singh, A.: A hybrid evolutionary algorithm with guided mutation for minimum weight dominating set. Appl. Intell. 43(3), 512–529 (2015)CrossRefGoogle Scholar
  6. 6.
    Bouamama, S., Blum, C.: A hybrid algorithmic model for the minimum weight dominating set problem. Simul. Model. Practice Theor. 64, 57–68 (2016)CrossRefGoogle Scholar
  7. 7.
    Lin, G., Zhu, W., Ali, M.M.: An effective hybrid memetic algorithm for the minimum weight dominating set problem. IEEE Trans. Evol. Comput. (2016, in press)Google Scholar
  8. 8.
    Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 177(3), 2033–2049 (2007)CrossRefzbMATHGoogle Scholar
  9. 9.
    Fanjul-Peyro, L., Ruiz, R.: Iterated greedy local search methods for unrelated parallel machine scheduling. Eur. J. Oper. Res. 207(1), 55–69 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Bouamama, S., Blum, C., Boukerram, A.: A population-based iterated greedy algorithm for the minimum weight vertex cover problem. Appl. Soft Comput. 12(6), 1632–1639 (2012)CrossRefGoogle Scholar
  11. 11.
    Porta, J., Parapar, J., Doallo, R., Barbosa, V., Santé, I., Crecente, R., Díaz, C.: A population-based iterated greedy algorithm for the delimitation and zoning of rural settlements. Comput. Environ. Urban Syst. 39, 12–26 (2013)CrossRefGoogle Scholar
  12. 12.
    López-Ibáñez, M., Dubois-Lacoste, J., Pérez Cáceres, L., Birattari, M., Stützle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43–58 (2016)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Pedro Pinacho Davidson
    • 1
    • 2
  • Christian Blum
    • 3
    Email author
  • José A. Lozano
    • 1
    • 4
  1. 1.Department of Computer Science and Artifical IntelligenceUniversity of the Basque Country UPV/EHUSan SebastianSpain
  2. 2.Escuela de InformáticaUniversidad Santo TomásConcepciónChile
  3. 3.Artificial Intelligence Research Institute (IIIA-CSIC)BellaterraSpain
  4. 4.Basque Center for Applied Mathematics (BCAM)BilbaoSpain

Personalised recommendations