A binary monkey search algorithm variation for solving the set covering problem
In complexity theory, there is a widely studied grouping of optimization problems that belongs to the non-deterministic polynomial-time hard set. One of them is the set covering problem, known as one of Karp's 21-complete problems, and it consists of finding a subset of decision variables for s...
| Autores principales: | , , , , , , , , |
|---|---|
| Formato: | Artículo (Article) |
| Idioma: | Inglés (English) |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://repositorio.uc.cl/handle/11534/100376 |