A binary fruit fly optimization algorithm to solve the set covering problem

dc.creatorCrawford B.
dc.creatorSoto R.
dc.creatorTorres-Rojas C.
dc.creatorPeña C.
dc.creatorRiquelme-Leiva M.
dc.creatorMisra S.
dc.creatorJohnson F.
dc.creatorParedes F.
dc.date.accessioned2020-09-02T22:16:14Z
dc.date.accessioned2022-11-08T20:19:15Z
dc.date.available2020-09-02T22:16:14Z
dc.date.available2022-11-08T20:19:15Z
dc.date.created2020-09-02T22:16:14Z
dc.date.issued2015
dc.identifier9158, , 411-420
dc.identifier03029743
dc.identifierhttps://hdl.handle.net/20.500.12728/4248
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5143080
dc.languageen
dc.publisherSpringer Verlag
dc.sourceGavrilova M.L.Gervasi O.Murgante B.Misra S.Torre C.Taniar D.Apduhan B.O.Rocha A.M.A.C.Misra S.
dc.subjectCombinatorial optimization problem
dc.subjectFruit Fly Optimization Algorithm
dc.subjectMetaheuristics
dc.subjectSet Covering Problem
dc.subjectAlgorithms
dc.subjectBins
dc.subjectCombinatorial optimization
dc.subjectComputational complexity
dc.subjectFruits
dc.subjectProblem solving
dc.subjectBinarizations
dc.subjectCombinatorial optimization problems
dc.subjectFruit flies
dc.subjectMeta heuristics
dc.subjectSet covering problem
dc.subjectOptimization
dc.titleA binary fruit fly optimization algorithm to solve the set covering problem
dc.typeConference Paper


Este ítem pertenece a la siguiente institución