The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches

DOI10.1007/978-3-319-55453-2_14zbMath1457.90121OpenAlexW2593677752MaRDI QIDQ3304199

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

Publication date: 5 August 2020

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11824/727

zbMATH Keywords

greedy heuristicsinteger linear programming model

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

The weighted independent domination problem: integer linear programming models and metaheuristic approaches ⋮ An Efficient Local Search for the Minimum Independent Dominating Set Problem

Uses Software

• CPLEX

Cites Work

• 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

This page was built for publication: The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches