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 pandemic con...

Ausführliche Beschreibung

Bibliografische Detailangaben

Veröffentlicht in:	Facultad de Ingeniería
Hauptverfasser:	Nelson-Enrique Quemá-Taimbud, Martha-Eliana Mendoza-Becerra, Oscar-Fernando Bedoya-Leyva
Format:	Artigo
Sprache:	Inglês
Veröffentlicht:	Universidad Pedagógica y Tecnológica de Colombia 2023
Schlagworte:	Ingeniería
Online-Zugang:	https://www.redalyc.org/articulo.oa?id=413975418006 https://www.redalyc.org/journal/4139/413975418006/ https://www.redalyc.org/journal/4139/413975418006/html/ https://www.redalyc.org/journal/4139/413975418006/413975418006.epub https://www.redalyc.org/journal/4139/413975418006/movil https://doi.org/10.19053/01211129.v32.n63.2023.15235
Tags:	Tag hinzufügen Keine Tags, Fügen Sie das erste Tag hinzu!