The weighted independent domination problem: integer linear programming models and metaheuristic approaches

DOI10.1016/j.ejor.2017.08.044zbMath1374.90296OpenAlexW2746282820MaRDI QIDQ1681137

Christian Blum, Pedro Pinacho Davidson, José A. Lozano

Publication date: 23 November 2017

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.08.044

zbMATH Keywords

heuristicscombinatorial optimizationinteger linear programmingpopulation-based iterated greedy

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Formalization of the Domination Chain with Weighted Parameters (Short Paper) ⋮ Exact and heuristic algorithms for the weighted total domination problem ⋮ Integer linear programming models for the weighted total domination problem

Uses Software

• irace
• scmamp
• ils-mwis

Cites Work

• Unnamed Item
• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
• Fast local search for the maximum independent set problem
• Dominating communities for hierarchical control of complex networks
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Iterated greedy local search methods for unrelated parallel machine scheduling
• The weighted independent domination problem is NP-complete for chordal graphs
• Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
• The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches
• A textbook of graph theory

This page was built for publication: The weighted independent domination problem: integer linear programming models and metaheuristic approaches