EUVIMEDEUVIMED entdecken
Crossref

A spatial branch-and-price-and-cut algorithm for finding globally optimal solutions to the continuous network design problem

Michael W. Levin, David Rey

Transportation Research Part E: Logistics and Transportation Review · 2026-07 · 211 · 104870

DOI: 10.1016/j.tre.2026.104870 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Transportation Research Part E: Logistics and Transportation Review, 2026-07. Verfasst von Michael W. Levin und 1 weiteren Autor:innen. Die Arbeit nennt 49 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Levin, M. W., & Rey, D. (2026). A spatial branch-and-price-and-cut algorithm for finding globally optimal solutions to the continuous network design problem. Transportation Research Part E: Logistics and Transportation Review, 211, 104870. https://doi.org/10.1016/j.tre.2026.104870

Vancouver

Levin MW, Rey D. A spatial branch-and-price-and-cut algorithm for finding globally optimal solutions to the continuous network design problem. Transportation Research Part E: Logistics and Transportation Review. 2026;211:104870. doi:10.1016/j.tre.2026.104870

BibTeX
@article{Levin2026,
  author = {Levin, Michael W. and Rey, David},
  title = {A spatial branch-and-price-and-cut algorithm for finding globally optimal solutions to the continuous network design problem},
  journal = {Transportation Research Part E: Logistics and Transportation Review},
  year = {2026},
  volume = {211},
  pages = {104870},
  doi = {10.1016/j.tre.2026.104870}
}
Kostenlos starten →