A polynomial time algorithm for convex cost lot-sizing problems.

Z. Melis Teksan Joseph Geunes

Published in: Oper. Res. Lett. (2015)

Keyphrases

worst case
bin packing
cutting stock
objective function
transportation problem
lot sizing
cost function
multistage
computational complexity
learning algorithm
dynamic programming
optimization problems
optimal solution
special case
convex hull
fixed cost
min sum