dc.creatorSoto R.
dc.creatorCrawford B.
dc.creatorFigueroa I.
dc.creatorOlivares R.
dc.creatorOlguin E.
dc.date.accessioned2020-09-02T22:28:40Z
dc.date.accessioned2022-11-08T20:27:14Z
dc.date.available2020-09-02T22:28:40Z
dc.date.available2022-11-08T20:27:14Z
dc.date.created2020-09-02T22:28:40Z
dc.date.issued2016
dc.identifier2016-July, , -
dc.identifier21660727
dc.identifierhttps://hdl.handle.net/20.500.12728/6296
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5146361
dc.languagees
dc.publisherIEEE Computer Society
dc.sourceRocha A.Reis L.P.Cota M.P.Goncalves R.Suarez O.S.
dc.subjectBlack hole algorithm
dc.subjectoptimization problem
dc.subjectset covering problem
dc.subjectAlgorithms
dc.subjectCombinatorial optimization
dc.subjectComputational complexity
dc.subjectGravitation
dc.subjectInformation systems
dc.subjectOptimization
dc.subjectStars
dc.subjectBlack holes
dc.subjectClassical problems
dc.subjectDiscretizations
dc.subjectMeta heuristics
dc.subjectMetaheuristic
dc.subjectOptimization problems
dc.subjectRepairing operators
dc.subjectSet covering problem
dc.subjectProblem solving
dc.titleThe set covering problem solved by the Black Hole Algorithm [El Problema de Cobertura de Conjuntos solucionado por el Algoritmo del Agujero Negro]
dc.typeConference Paper


Este ítem pertenece a la siguiente institución