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...
मुख्य लेखकों: | Quemá-Taimbud, Nelson-Enrique, Mendoza-Becerra, Martha-Eliana, Bedoya-Leyva, Oscar-Fernando |
---|---|
स्वरूप: | Online |
भाषा: | eng |
प्रकाशित: |
Universidad Pedagógica y Tecnológica de Colombia
2023
|
विषय: | |
ऑनलाइन पहुंच: | https://revistas.uptc.edu.co/index.php/ingenieria/article/view/15235 |
- समान संसाधन
-
Metaheuristic algorithms for building Covering Arrays: A review
द्वारा: Timaná-Peña, Jimena Adriana, और अन्य
प्रकाशित: (2016) -
Semi-Automatic Mapping Technique Using Snowballing to Support Massive Literature Searches in Software Engineering
द्वारा: Suescún-Monsalve, Elizabeth, और अन्य
प्रकाशित: (2022) -
A memetic algorithm for minimizing the makespan in the Job Shop Scheduling problem
द्वारा: Lamos-Díaz, Henry, और अन्य
प्रकाशित: (2017) -
A methodology for creating feeding routes in mass transit systems
द्वारा: Ospina-Toro, Daniela, और अन्य
प्रकाशित: (2017) -
Automatic Extractive Single Document Summarization: A Systematic Mapping
द्वारा: Yip-Herrera, Juan-David, और अन्य
प्रकाशित: (2023)