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...
Bewaard in:
| Hoofdauteurs: | , , , , |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
MDPI AG
2024-05-01
|
| Reeks: | Biomimetics |
| Onderwerpen: | |
| Online toegang: | https://www.mdpi.com/2313-7673/9/5/283 |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|