A comparison of three recent nature-inspired metaheuristics for the set covering problem

dc.creatorCrawford B.
dc.creatorSoto R.
dc.creatorPeña C.
dc.creatorRiquelme-Leiva M.
dc.creatorTorres-Rojas C.
dc.creatorMisra S.
dc.creatorJohnson F.
dc.creatorParedes F.
dc.date.accessioned2020-09-02T22:15:29Z
dc.date.accessioned2022-11-08T20:26:22Z
dc.date.available2020-09-02T22:15:29Z
dc.date.available2022-11-08T20:26:22Z
dc.date.created2020-09-02T22:15:29Z
dc.date.issued2015
dc.identifier9158, , 431-443
dc.identifier03029743
dc.identifierhttps://hdl.handle.net/20.500.12728/4072
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5146030
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.subjectFirefly algorithm
dc.subjectFruit fly algorithm
dc.subjectMetaheuristics
dc.subjectSet Covering Problem
dc.subjectShuffled Frog Leaping Algorithm
dc.subjectAlgorithms
dc.subjectBioluminescence
dc.subjectCombinatorial optimization
dc.subjectComputational complexity
dc.subjectFruits
dc.subjectHeuristic algorithms
dc.subjectFirefly algorithms
dc.subjectFruit flies
dc.subjectMeta heuristics
dc.subjectSet covering problem
dc.subjectShuffled frog leaping algorithm (SFLA)
dc.subjectOptimization
dc.titleA comparison of three recent nature-inspired metaheuristics for the set covering problem
dc.typeConference Paper


Este ítem pertenece a la siguiente institución