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

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

doi
#
Article type
Journal
https://people.iut.ac.ir/en/mirmohammadi/content/1605292