Buscar
Mostrando ítems 1-10 de 25
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)
Binary cat swarm optimization for the set covering problem [Optimización por Colonia de Gatos del Problema de Cobertura de Conjuntos] (2020)
(Institute of Electrical and Electronics Engineers Inc., 2015)
Recent harmony search algorithms for 0–1 optimization problems (2020)
(Springer Verlag, 2015)
A timetabling applied case solved with ant colony optimization (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)