An exact pruned route-enumeration and set-partitioning approach for the multi-pickup and delivery problem with time windows
Computers & Operations Research · 2026-12 · 196 · 107643
DOI: 10.1016/j.cor.2026.107643 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2026-12. Verfasst von Conor Kikkert und 1 weiteren Autor:innen. Die Arbeit nennt 25 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Kikkert, C., & Forbes, M. (2026). An exact pruned route-enumeration and set-partitioning approach for the multi-pickup and delivery problem with time windows. Computers & Operations Research, 196, 107643. https://doi.org/10.1016/j.cor.2026.107643
Vancouver
Kikkert C, Forbes M. An exact pruned route-enumeration and set-partitioning approach for the multi-pickup and delivery problem with time windows. Computers & Operations Research. 2026;196:107643. doi:10.1016/j.cor.2026.107643
BibTeX
@article{Kikkert2026,
author = {Kikkert, Conor and Forbes, Michael},
title = {An exact pruned route-enumeration and set-partitioning approach for the multi-pickup and delivery problem with time windows},
journal = {Computers & Operations Research},
year = {2026},
volume = {196},
pages = {107643},
doi = {10.1016/j.cor.2026.107643}
}
EUVIMED