Exact approaches for solving a covering problem with capacitated subtrees
Idioma
en
Article de revue
Este ítem está publicado en
Computers and Operations Research. 2019-05, vol. 105, p. 85-101
Elsevier
Resumen en inglés
In this document, we present a covering problem where vertices of a graph have to be covered by rooted subtrees. We present three mixed-integer linear programming models, two of which are compact while the other is based ...Leer más >
In this document, we present a covering problem where vertices of a graph have to be covered by rooted subtrees. We present three mixed-integer linear programming models, two of which are compact while the other is based on Dantzig-Wolfe decomposition. In the latter case, we focus on the column generation subproblem, for which we propose several algorithms. Numerical results are obtained using instances from the literature and instances based on a real-life districting application. Experiments show that the branch-and-price algorithm is able to solve much bigger instances than the compact model, which is limited to very small instance sizes.< Leer menos
Palabras clave en inglés
Dantzig-Wolfe decomposition
Column generation
Covering problems
Dynamic programming
Branch-and-bound
Orígen
Importado de HalCentros de investigación