A generalized model and a heuristic algorithm for the large-scale covering tour problem
RAIRO-Oper. Res., 52 2 (2018) 577-594
Published online: 2018-07-20
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Modeling a humanitarian‐aid covering tour problem with location selection and vehicle assignment decisions
Kaan Kılıç, Melike Meterelliyoz, İlay Güvenç Pelit and Mehmet SoysalInternational Transactions in Operational Research 33 (3) 1559 (2026)
https://doi.org/10.1111/itor.70088
Optimization of monitoring, data collecting, and energy resupplying tasks with scarce resources
Luigi Di Puglia Pugliese, Marcello Sammarra, Giusy Macrina and Francesca GuerrieroProcedia Computer Science 253 1870 (2025)
https://doi.org/10.1016/j.procs.2025.01.249
97 (2025)
https://doi.org/10.1007/978-3-031-58405-3_13
The drop box location problem
Adam Schmidt and Laura A. AlbertIISE Transactions 56 (4) 424 (2024)
https://doi.org/10.1080/24725854.2023.2213754
Set Covering Routing Problems: A review and classification scheme
Nima Moradi, Fereshteh Mafakheri and Chun WangComputers & Industrial Engineering 198 110730 (2024)
https://doi.org/10.1016/j.cie.2024.110730
The location-or-routing problem
Okan ArslanTransportation Research Part B: Methodological 147 1 (2021)
https://doi.org/10.1016/j.trb.2021.02.010