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...
Autors principals: | Quemá-Taimbud, Nelson-Enrique, Mendoza-Becerra, Martha-Eliana, Bedoya-Leyva, Oscar-Fernando |
---|---|
Format: | Online |
Idioma: | eng |
Publicat: |
Universidad Pedagógica y Tecnológica de Colombia
2023
|
Matèries: | |
Accés en línia: | https://revistas.uptc.edu.co/index.php/ingenieria/article/view/15235 |
- Ítems similars
-
Metaheuristic algorithms for building Covering Arrays: A review
per: Timaná-Peña, Jimena Adriana, et al.
Publicat: (2016) -
Semi-Automatic Mapping Technique Using Snowballing to Support Massive Literature Searches in Software Engineering
per: Suescún-Monsalve, Elizabeth, et al.
Publicat: (2022) -
A memetic algorithm for minimizing the makespan in the Job Shop Scheduling problem
per: Lamos-Díaz, Henry, et al.
Publicat: (2017) -
A methodology for creating feeding routes in mass transit systems
per: Ospina-Toro, Daniela, et al.
Publicat: (2017) -
Automatic Extractive Single Document Summarization: A Systematic Mapping
per: Yip-Herrera, Juan-David, et al.
Publicat: (2023)