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
Θέματα:	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
Διαθέσιμο Online:	https://revistas.uptc.edu.co/index.php/ingenieria/article/view/15235