APA (7th ed.) Citation

Mhamedi, T., Cherkesly, M., & Desaulniers, G. (2026). A Branch-Price-and-Cut Algorithm for the Multicommodity Two-Echelon Vehicle Routing Problem with Time Windows. INFORMS Journal on Computing, 1. https://doi.org/10.1287/ijoc.2024.1010

Chicago Style (17th ed.) Citation

Mhamedi, Tayeb, Marilène Cherkesly, and Guy Desaulniers. "A Branch-Price-and-Cut Algorithm for the Multicommodity Two-Echelon Vehicle Routing Problem with Time Windows." INFORMS Journal on Computing 2026: 1. https://doi.org/10.1287/ijoc.2024.1010.

MLA (9th ed.) Citation

Mhamedi, Tayeb, et al. "A Branch-Price-and-Cut Algorithm for the Multicommodity Two-Echelon Vehicle Routing Problem with Time Windows." INFORMS Journal on Computing, 2026, p. 1, https://doi.org/10.1287/ijoc.2024.1010.