Login / Signup

Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount.

Yaser MalekianS. Hamid MirmohammadiMehdi Bijari
Published in: Comput. Oper. Res. (2021)
Keyphrases
  • single item
  • computational complexity
  • multi item
  • quantity discount
  • learning algorithm
  • lot sizing
  • optimal solution
  • supply chain
  • linear programming
  • special case
  • long run