Gomez A.Crawford, B.Soto, R.Jaramillo, A.Mansilla, S.Salas, J.Olguin, E.6/22/20222022-09-306/22/20222022-09-302016https://doi.org/10.1109/CISTI.2016.7521431The Set Covering Problem (SCP) is one of the most representative combinatorial optimization problems and it has multiple applications in different situations of engineering, sciences and some other disciplines. It aims to find a set of solutions that meet the needs defined in the constraints having lowest possible cost. In this paper we used an existing binary algorithm inspired by Binary Black Holes (BBH), to solve multiple instances of the problem with known benchmarks obtained from the OR-library. The presented method emulates the behavior of these celestial bodies using a rotation operator to bring good solutions. © 2016 AISTI.application/pdfspainfo:eu-repo/semantics/closedAccessComputer Scienceinfo:eu-repo/semantics/article10.1109/CISTI.2016.7521431http://purl.org/pe-repo/ocde/ford#1.02.01