EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Solving heterogeneous vehicle routing problems using decomposition and set covering

Christoph Kerscher, Stefan Minner, Fabien Lehuédé, Guillaume Massonnet

Computers & Operations Research · 2026-09 · 193 · 107505

DOI: 10.1016/j.cor.2026.107505 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computers & Operations Research, 2026-09. Verfasst von Christoph Kerscher und 3 weiteren Autor:innen. Die Arbeit nennt 70 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: SAP.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • SAP

Zitieren

APA

Kerscher, C., Minner, S., Lehuédé, F., & Massonnet, G. (2026). Solving heterogeneous vehicle routing problems using decomposition and set covering. Computers & Operations Research, 193, 107505. https://doi.org/10.1016/j.cor.2026.107505

Vancouver

Kerscher C, Minner S, Lehuédé F, Massonnet G. Solving heterogeneous vehicle routing problems using decomposition and set covering. Computers & Operations Research. 2026;193:107505. doi:10.1016/j.cor.2026.107505

BibTeX
@article{Kerscher2026,
  author = {Kerscher, Christoph and Minner, Stefan and Lehuédé, Fabien and Massonnet, Guillaume},
  title = {Solving heterogeneous vehicle routing problems using decomposition and set covering},
  journal = {Computers & Operations Research},
  year = {2026},
  volume = {193},
  pages = {107505},
  doi = {10.1016/j.cor.2026.107505}
}
Kostenlos starten →