Crawford, B.Soto, R.Aballay, F.Misra, S.Johnson, F.Paredes, F.6/22/20222022-06-226/22/20222022-06-222015https://link.springer.com/chapter/10.1007/978-3-319-21410-8_33https://doi.org/10.17559/TV-20180501230511https://doaj.org/article/bc1bfd1074a041cfb709d47ab06657d5https://hrcak.srce.hr/244863The Set Covering Problem (SCP) is a representation of a kind of combinatorial optimization problem which has been applied in several problems in the real world. In this work we used a binary version of Teaching-Learning-Based Optimization (TLBO) algorithm to solve SCP, works with two phases known: teacher and learner; emulating the behavior into a classroom. The proposed algorithm has been tested on 65 benchmark instances. The results show that it has the ability to produce solutions competitively. © Springer International Publishing Switzerland 2015.application/pdfen-USinfo:eu-repo/semantics/closedAccessComputer ScienceMathematicsinfo:eu-repo/semantics/conferenceObject10.1007/978-3-319-21410-833http://purl.org/pe-repo/ocde/ford#2.02.04