Buscar
Mostrando ítems 11-20 de 39
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)
Solving the set covering problem with a shuffled frog leaping algorithm (2020)
(Springer Verlag, 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)
Using binary fruit fly algorithm for solving the set covering problem [Utilizando el Algoritmo binario Fruit Fly para resolver el Problema del Conjunto de Cobertura] (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 a distribution network design problem by combining ant colony systems and Lagrangian relaxation (2020)
(National Institute for R and D in Informatics, 2015)