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.
CITATION STYLE
Reyes, V., Araya, I., Crawford, B., Soto, R., & Olguín, E. (2016). A beam-search approach to the set covering problem. In Advances in Intelligent Systems and Computing (Vol. 464, pp. 395–402). Springer Verlag. https://doi.org/10.1007/978-3-319-33625-1_35
Mendeley helps you to discover research relevant for your work.