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...

Celý popis

Podrobná bibliografie

Hlavní autoři:	Dante Leiva, Benjamín Ramos-Tapia, Broderick Crawford, Ricardo Soto, Felipe Cisternas-Caneo
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	MDPI AG 2024-05-01
Edice:	Biomimetics
Témata:	set-covering problem metaheuristics optimization combinatorial problems
On-line přístup:	https://www.mdpi.com/2313-7673/9/5/283
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!