"Revisiting the Set k-Covering Problem"
Thiago Virgilio, Anderson Ramos, Amanda Silva and Luciana Pessoa
The set k-covering problem is an extension of the well studied set covering problem in which, given a binary matrix 0-1 with costs linked to the columns, each row is required to be covered at least k times, by choosing a minimum cost subset of columns. Since the development of the first metaheuristic for this problem, in 2011, some progress has been reached for solving it and harder instances have been proposed. This short work in progress aims to bring a new application of the Iterated Local Search (ILS) metaheuristics to explore the set k-covering problem. Some experiments were carried out to show the direction to be followed in this research.