A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches
[chapter]
2017
Lecture Notes in Computer Science
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 work, this paper considers the problem from a non-theoretical perspective. The first contribution consists in the development of three integer linear programming models. Second, two greedy heuristics are proposed. Finally, the last contribution is a population-based iterated greedy metaheuristic which is applied in two different
doi:10.1007/978-3-319-55453-2_14
fatcat:fxmauiqzs5fyhdbkb6b45j6ueq