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...
Hlavní autoři: | Quemá-Taimbud, Nelson-Enrique, Mendoza-Becerra, Martha-Eliana, Bedoya-Leyva, Oscar-Fernando |
---|---|
Médium: | Online |
Jazyk: | eng |
Vydáno: |
Universidad Pedagógica y Tecnológica de Colombia
2023
|
Témata: | |
On-line přístup: | https://revistas.uptc.edu.co/index.php/ingenieria/article/view/15235 |
- Podobné jednotky
-
Metaheuristic algorithms for building Covering Arrays: A review
Autor: Timaná-Peña, Jimena Adriana, a další
Vydáno: (2016) -
Semi-Automatic Mapping Technique Using Snowballing to Support Massive Literature Searches in Software Engineering
Autor: Suescún-Monsalve, Elizabeth, a další
Vydáno: (2022) -
A memetic algorithm for minimizing the makespan in the Job Shop Scheduling problem
Autor: Lamos-Díaz, Henry, a další
Vydáno: (2017) -
A methodology for creating feeding routes in mass transit systems
Autor: Ospina-Toro, Daniela, a další
Vydáno: (2017) -
Automatic Extractive Single Document Summarization: A Systematic Mapping
Autor: Yip-Herrera, Juan-David, a další
Vydáno: (2023)