A branch-and-price-and-cut algorithm for discrete network design problems under traffic equilibrium
Transportation Research Part B: Methodological · 2026-10 · 212 · 103563
DOI: 10.1016/j.trb.2026.103563 ↗Kurz gefasst
Fachartikel in der Zeitschrift Transportation Research Part B: Methodological, 2026-10. Verfasst von David Rey und 1 weiteren Autor:innen. Die Arbeit nennt 51 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Rey, D., & Levin, M. W. (2026). A branch-and-price-and-cut algorithm for discrete network design problems under traffic equilibrium. Transportation Research Part B: Methodological, 212, 103563. https://doi.org/10.1016/j.trb.2026.103563
Vancouver
Rey D, Levin MW. A branch-and-price-and-cut algorithm for discrete network design problems under traffic equilibrium. Transportation Research Part B: Methodological. 2026;212:103563. doi:10.1016/j.trb.2026.103563
BibTeX
@article{Rey2026,
author = {Rey, David and Levin, Michael W.},
title = {A branch-and-price-and-cut algorithm for discrete network design problems under traffic equilibrium},
journal = {Transportation Research Part B: Methodological},
year = {2026},
volume = {212},
pages = {103563},
doi = {10.1016/j.trb.2026.103563}
}
EUVIMED