A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem
Computers & Operations Research · 2024-01 · 161 · 106426
DOI: 10.1016/j.cor.2023.106426 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2024-01. Verfasst von Bencomo Domínguez-Martín und 3 weiteren Autor:innen. Die Arbeit wurde bisher 15-mal zitiert (Crossref) und nennt 30 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0). Gefördert von: Ministerio de Ciencia e Innovación, Gobierno de España Ministerio de Ciencia e Innovación.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Ministerio de Ciencia e Innovación
- Gobierno de España Ministerio de Ciencia e Innovación
Zitieren
APA
Domínguez-Martín, B., Hernández-Pérez, H., Riera-Ledesma, J., & Rodríguez-Martín, I. (2024). A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem. Computers & Operations Research, 161, 106426. https://doi.org/10.1016/j.cor.2023.106426
Vancouver
Domínguez-Martín B, Hernández-Pérez H, Riera-Ledesma J, Rodríguez-Martín I. A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem. Computers & Operations Research. 2024;161:106426. doi:10.1016/j.cor.2023.106426
BibTeX
@article{DomnguezMartn2024,
author = {Domínguez-Martín, Bencomo and Hernández-Pérez, Hipólito and Riera-Ledesma, Jorge and Rodríguez-Martín, Inmaculada},
title = {A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem},
journal = {Computers & Operations Research},
year = {2024},
volume = {161},
pages = {106426},
doi = {10.1016/j.cor.2023.106426}
}
EUVIMED