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...
Những tác giả chính: | Quemá-Taimbud, Nelson-Enrique, Mendoza-Becerra, Martha-Eliana, Bedoya-Leyva, Oscar-Fernando |
---|---|
Định dạng: | Online |
Ngôn ngữ: | eng |
Được phát hành: |
Universidad Pedagógica y Tecnológica de Colombia
2023
|
Những chủ đề: | |
Truy cập trực tuyến: | https://revistas.uptc.edu.co/index.php/ingenieria/article/view/15235 |
- Những quyển sách tương tự
-
Metaheuristic algorithms for building Covering Arrays: A review
Bằng: Timaná-Peña, Jimena Adriana, et al.
Được phát hành: (2016) -
Semi-Automatic Mapping Technique Using Snowballing to Support Massive Literature Searches in Software Engineering
Bằng: Suescún-Monsalve, Elizabeth, et al.
Được phát hành: (2022) -
A memetic algorithm for minimizing the makespan in the Job Shop Scheduling problem
Bằng: Lamos-Díaz, Henry, et al.
Được phát hành: (2017) -
A methodology for creating feeding routes in mass transit systems
Bằng: Ospina-Toro, Daniela, et al.
Được phát hành: (2017) -
Automatic Extractive Single Document Summarization: A Systematic Mapping
Bằng: Yip-Herrera, Juan-David, et al.
Được phát hành: (2023)