A beam-search approach to the set covering problem
Fecha
2016
Autores
Título de la revista
ISSN de la revista
Título del volumen
Editor
Springer Verlag
Resumen
In this work we present a beam-search approach applied to the Set Covering Problem. The goal of this problem is to choose a subset of columns of minimal cost covering every row. Beam Search constructs a search tree by using a breadthfirst search strategy, however only a fixed number of nodes are kept and the rest are discarded. Even though original beam search has a deterministic nature, our proposal has some elements that makes it stochastic. This approach has been tested with a well-known set of 45 SCP benchmark instances from OR-Library showing promising results. © Springer International Publishing Switzerland 2016.
Descripción
Palabras clave
Computer Science, Engineering