Reyes, V.Araya, I.Crawford, B.Soto, R.Olguín, E.6/22/20226/22/20222016https://doi.org/10.1007/978-3-319-33625-1_35In 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.application/pdfen-USinfo:eu-repo/semantics/closedAccessComputer ScienceEngineeringinfo:eu-repo/semantics/conferenceObject10.1007/978-3-319-33625-1_35http://purl.org/pe-repo/ocde/ford#2.02.04