Solving the set covering problem with a binary black hole inspired algorithm

dc.creatorRubio Á.G.
dc.creatorCrawford B.
dc.creatorSoto R.
dc.creatorOlguín E.
dc.creatorMisra S.
dc.creatorJaramillo A.
dc.creatorVillablanca S.M.
dc.creatorSalas J.
dc.date.accessioned2020-09-02T22:27:32Z
dc.date.accessioned2022-11-08T20:23:10Z
dc.date.available2020-09-02T22:27:32Z
dc.date.available2022-11-08T20:23:10Z
dc.date.created2020-09-02T22:27:32Z
dc.date.issued2016
dc.identifier9786, , 207-219
dc.identifier03029743
dc.identifierhttps://hdl.handle.net/20.500.12728/6105
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5144732
dc.languageen
dc.publisherSpringer Verlag
dc.sourceApduhan B.O.Murgante B.Misra S.Taniar D.Torre C.M.Rocha A.M.A.C.Wang S.Gervasi O.Stankova E.
dc.subjectBinary black hole
dc.subjectCombinatorial optimization problem
dc.subjectMeta heuristics
dc.subjectSet Covering Problem
dc.subjectAlgorithms
dc.subjectBins
dc.subjectCombinatorial optimization
dc.subjectCost engineering
dc.subjectGravitation
dc.subjectStars
dc.subjectBlack holes
dc.subjectCombinatorial optimization problems
dc.subjectMeta heuristics
dc.subjectSet covering problem
dc.subjectOptimization
dc.titleSolving the set covering problem with a binary black hole inspired algorithm
dc.typeConference Paper


Este ítem pertenece a la siguiente institución