Open Access · CC BY 4.0
A note on a heuristic for the maximal covering location disruption problem
Computers & Operations Research · 2026-12 · 196 · 107687
DOI: 10.1016/j.cor.2026.107687 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2026-12. Verfasst von Markus Sinnl und 1 weiteren Autor:innen. Die Arbeit nennt 3 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Sinnl, M., & Tanınmış, K. (2026). A note on a heuristic for the maximal covering location disruption problem. Computers & Operations Research, 196, 107687. https://doi.org/10.1016/j.cor.2026.107687
Vancouver
Sinnl M, Tanınmış K. A note on a heuristic for the maximal covering location disruption problem. Computers & Operations Research. 2026;196:107687. doi:10.1016/j.cor.2026.107687
BibTeX
@article{Sinnl2026,
author = {Sinnl, Markus and Tanınmış, Kübra},
title = {A note on a heuristic for the maximal covering location disruption problem},
journal = {Computers & Operations Research},
year = {2026},
volume = {196},
pages = {107687},
doi = {10.1016/j.cor.2026.107687}
}
EUVIMED