Cite
Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows.
MLA
Liu, Yiming, et al. “Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows.” INFORMS Journal on Computing, vol. 35, no. 1, Jan. 2023, pp. 14–30. EBSCOhost, https://doi.org/10.1287/ijoc.2022.1195.
APA
Liu, Y., Yu, Y., Zhang, Y., Baldacci, R., Tang, J., Luo, X., & Sun, W. (2023). Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows. INFORMS Journal on Computing, 35(1), 14–30. https://doi.org/10.1287/ijoc.2022.1195
Chicago
Liu, Yiming, Yang Yu, Yu Zhang, Roberto Baldacci, Jiafu Tang, Xinggang Luo, and Wei Sun. 2023. “Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows.” INFORMS Journal on Computing 35 (1): 14–30. doi:10.1287/ijoc.2022.1195.