A Novel Approach to Combinatorial Problems: Binary Growth Optimizer Algorithm

The set-covering problem aims to find the smallest possible set of subsets that cover all the elements of a larger set. The difficulty of solving the set-covering problem increases as the number of elements and sets grows, making it a complex problem for which traditional integer programming solutio...

Descripció completa

Dades bibliogràfiques

Autors principals:	Dante Leiva, Benjamín Ramos-Tapia, Broderick Crawford, Ricardo Soto, Felipe Cisternas-Caneo
Format:	Artigo
Idioma:	Inglês
Publicat:	MDPI AG 2024-05-01
Col·lecció:	Biomimetics
Matèries:	set-covering problem metaheuristics optimization combinatorial problems
Accés en línia:	https://www.mdpi.com/2313-7673/9/5/283
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!