Login / Signup
A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs.
Bertrand Hellion
Fabien Mangione
Bernard Penz
Published in:
Eur. J. Oper. Res. (2012)
Keyphrases
</>
computational complexity
worst case
single item
learning algorithm
cost function
lot sizing
np hard
dynamic programming
optimal solution
objective function
simulated annealing
multi item
control system
linear programming
mathematical model
convex hull
mixed integer programming