Exact approaches for solving a covering problem with capacitated subtrees
Langue
en
Article de revue
Ce document a été publié dans
Computers and Operations Research. 2019-05, vol. 105, p. 85-101
Elsevier
Résumé en anglais
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 ...Lire la suite >
Mots clés en anglais
Dantzig-Wolfe decomposition
Column generation
Covering problems
Dynamic programming
Branch-and-bound