A binary coded firefly algorithm that solves the set covering problem

dc.creatorCrawford B.
dc.creatorSoto R.
dc.creatorOlivares-Suárez M.
dc.creatorPalma W.
dc.creatorParedes F.
dc.creatorOlguín E.
dc.creatorNorero E.
dc.date.accessioned2020-09-02T22:15:42Z
dc.date.accessioned2022-11-08T20:22:29Z
dc.date.available2020-09-02T22:15:42Z
dc.date.available2022-11-08T20:22:29Z
dc.date.created2020-09-02T22:15:42Z
dc.date.issued2014
dc.identifier17, 3, 252-264
dc.identifier14538245
dc.identifierhttps://hdl.handle.net/20.500.12728/4162
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5144443
dc.languageen
dc.publisherEditura Academiei Romane
dc.subjectBinary firefly algorithm
dc.subjectMetaheuristic
dc.subjectSet covering problem
dc.titleA binary coded firefly algorithm that solves the set covering problem
dc.typeArticle


Este ítem pertenece a la siguiente institución