Buscar
Mostrando ítems 1-10 de 12
A comparison of three recent nature-inspired metaheuristics for the set covering problem (2020)
(Springer Verlag, 2015)
A teaching-learning-based optimization algorithm for solving set covering problems (2020)
(Springer Verlag, 2015)
The set covering problem solved by the binary teaching-learning-based optimization algorithm [Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje] (2020)
(Institute of Electrical and Electronics Engineers Inc., 2015)
Binary bat algorithms for the set covering problem [Algoritmos Murciélago Binarios para el Problema de Cobertura de Conjuntos] (2020)
(Institute of Electrical and Electronics Engineers Inc., 2015)
Binarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem [Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto] (2020)
(Institute of Electrical and Electronics Engineers Inc., 2015)
Set covering problem solved by new binary firefly algorithm [Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario] (2020)
(Institute of Electrical and Electronics Engineers Inc., 2015)
A binary fruit fly optimization algorithm to solve the set covering problem (2020)
(Springer Verlag, 2015)
Solving pre-processed set covering problems via cuckoo search and lévy flights [Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight] (2020)
(Institute of Electrical and Electronics Engineers Inc., 2015)