Binarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem

Crawford, B; Soto R.; Peña C; Riquelme-Leiva, M; Torres-Rojas, C; Johnson, F; Paredes, F

Keywords: metaheuristics, set covering problem, Shuffled Frog Leaping Algorithm

Más información

Título según WOS: Binarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem
Título de la Revista: PROCEEDINGS OF THE 2015 10TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI 2015)
Editorial: IEEE
Fecha de publicación: 2015
Idioma: Spanish
Notas: ISI