Malekian, Y., Mirmohammadi, S. H., & Bijari, M. (2021). Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount. Computers & operations research, 134, 105373. https://doi.org/10.1016/j.cor.2021.105373
Chicago-Zitierstil (17. Ausg.)Malekian, Yaser, S. Hamid Mirmohammadi, und Mehdi Bijari. "Polynomial-time Algorithms to Solve the Single-item Capacitated Lot Sizing Problem with a 1-breakpoint All-units Quantity Discount." Computers & Operations Research 134 (2021): 105373. https://doi.org/10.1016/j.cor.2021.105373.
MLA-Zitierstil (9. Ausg.)Malekian, Yaser, et al. "Polynomial-time Algorithms to Solve the Single-item Capacitated Lot Sizing Problem with a 1-breakpoint All-units Quantity Discount." Computers & Operations Research, vol. 134, 2021, p. 105373, https://doi.org/10.1016/j.cor.2021.105373.