Luo, H., Ma, T. & Li, Z.* (2025). An exact branch-price-and-cut algorithm for the time-dependent cold chain pickup and delivery problem with incompatibility constraints. Computers & Operations Research, 178, 107007. (SCI, JCR Q1, ABS 3, FMS B)
发布时间：2026-06-15
点击次数：
- 发布时间：
- 2026-06-15
- 论文名称：
- Luo, H., Ma, T. & Li, Z.* (2025). An exact branch-price-and-cut algorithm for the time-dependent cold chain pickup and delivery problem with incompatibility constraints. Computers & Operations Research, 178, 107007. (SCI, JCR Q1, ABS 3, FMS B)
- 是否译文：
- 否
- 上一条：Luo, H., Wang, D.*, Li, Y., Lu, X., Gao, M., & Chen, H. (2025). A sample average approximation-based approach for the last mile delivery and pickup problem with load-dependent travel time under uncertainties. Engineering Applications of Artificial Intelligence, 155, 110944. (SCI, JCR Q1)
- 下一条：Luo, H., Dridi, M., & Grunder, O.* (2023). A branch-price-and-cut algorithm for a time-dependent green vehicle routing problem with the consideration of traffic congestion. Computers & Industrial Engineering, 177, 109093. (SCI, JCR Q1, ABS 2, FMS B)