Solving the set covering problem with a shuffled frog leaping algorithm

dc.creatorCrawford B.
dc.creatorSoto R.
dc.creatorPeña C.
dc.creatorPalma W.
dc.creatorJohnson F.
dc.creatorParedes F.
dc.date.accessioned2020-09-02T22:15:43Z
dc.date.accessioned2022-11-08T20:19:26Z
dc.date.available2020-09-02T22:15:43Z
dc.date.available2022-11-08T20:19:26Z
dc.date.created2020-09-02T22:15:43Z
dc.date.issued2015
dc.identifier9012, , 41-50
dc.identifier03029743
dc.identifierhttps://hdl.handle.net/20.500.12728/4167
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5143178
dc.languageen
dc.publisherSpringer Verlag
dc.sourceNguyen N.T.Trawinski B.Nguyen N.T.Kosala R.
dc.subjectArtificial and computational intelligence
dc.subjectMetaheuristics
dc.subjectSet covering problem
dc.subjectShuffled frog leaping algorithm
dc.subjectArtificial intelligence
dc.subjectDatabase systems
dc.subjectFactory automation
dc.subjectInformation exchanges
dc.subjectMemetic
dc.subjectMemetic evolutions
dc.subjectMemetics
dc.subjectMeta heuristics
dc.subjectMetaheuristic
dc.subjectSet covering problem
dc.subjectShuffled frog leaping algorithm (SFLA)
dc.subjectAlgorithms
dc.titleSolving the set covering problem with a shuffled frog leaping algorithm
dc.typeConference Paper


Este ítem pertenece a la siguiente institución