Salas, J.Crawford, B.Soto, R.Rubio Á.G.Jaramillo, A.Mansilla Villablanca, S.Olguín, E.6/22/20222022-06-226/22/20222022-06-222016https://doi.org/10.1007/978-3-319-42007-3_78This paper is intended to generate solutions to Set Covering Problem (SCP) through the use of a metaheuristic. The results were obtained using a variation of Harmony Search called Binary Global-Best Harmony Search Algorithm. To measure the effectiveness of the technique against other metaheuristics, Weasly benchmark was used. © Springer International Publishing Switzerland 2016.application/pdfen-USinfo:eu-repo/semantics/closedAccessComputer ScienceMathematicsinfo:eu-repo/semantics/conferenceObject10.1007/978-3-319-42007-3_78http://purl.org/pe-repo/ocde/ford#2.02.04