Initialization and Local Search Methods Applied to the Set Covering Problem: A Systematic Mapping
The set covering problem (SCP) is a classical combinatorial optimization problem part of Karp's 21 NP-complete problems. Many real-world applications can be modeled as set covering problems (SCPs), such as locating emergency services, military planning, and decision-making in a COVID-19 pandem...
- Autores:
- Tipo de recurso:
- Fecha de publicación:
- 2023
- Institución:
- Universidad Pedagógica y Tecnológica de Colombia
- Repositorio:
- RiUPTC: Repositorio Institucional UPTC
- Idioma:
- eng
- OAI Identifier:
- oai:repositorio.uptc.edu.co:001/14364
- Acceso en línea:
- https://revistas.uptc.edu.co/index.php/ingenieria/article/view/15235
https://repositorio.uptc.edu.co/handle/001/14364
- Palabra clave:
- set covering problem
local search
systematic mapping
heuristics
initialization
metaheuristics
optimization
problema de cobertura de conjuntos
búsqueda local
mapeo sistemático
heurísticas
inicialización
metaheurísticas
optimización
- Rights
- License
- http://creativecommons.org/licenses/by/4.0