Gao, M., Chen, Y., Li, J., & Wahab, M. (2023). Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows. Computers & operations research, 157, 106267. https://doi.org/10.1016/j.cor.2023.106267
Citace podle Chicago (17th ed.)Gao, Mujin, Yanru Chen, Junheng Li, a M.I.M Wahab. "Hybrid Branch-and-price-and-cut Algorithm for the Two-dimensional Vector Packing Problem with Time Windows." Computers & Operations Research 157 (2023): 106267. https://doi.org/10.1016/j.cor.2023.106267.
Citace podle MLA (9th ed.)Gao, Mujin, et al. "Hybrid Branch-and-price-and-cut Algorithm for the Two-dimensional Vector Packing Problem with Time Windows." Computers & Operations Research, vol. 157, 2023, p. 106267, https://doi.org/10.1016/j.cor.2023.106267.