A beam-search approach to the set covering problem
MetadataShow full item record
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.
Showing items related by title, author, creator and subject.
Conference PaperCrawford B.; Soto R.; Olguín E.; Villablanca S.M.; Rubio Á.G.; Jaramillo A.; Salas J. (Springer Verlag, 2016)
ArticleAraya I.; Soto R.; Crawford B. (Elsevier Ltd, 2015)
Conference PaperMonfroy E.; Crawford B.; Soto R. (2013)