Código QR (código de barras bidimensional)

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

Fuld beskrivelse

Na minha lista:
Principais autores: Dante Leiva, Benjamín Ramos-Tapia, Broderick Crawford, Ricardo Soto, Felipe Cisternas-Caneo
Format: Artigo
Sprog:Inglês
Udgivet: MDPI AG 2024-05-01
Serier:Biomimetics
Fag:
set-covering problem
metaheuristics
optimization
combinatorial problems
Online adgang:https://www.mdpi.com/2313-7673/9/5/283
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!

Lignende værker