A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale.

S. Hamid Mirmohammadi Kourosh Eshghi

Published in: Comput. Oper. Res. (2012)

Keyphrases

mathematical model
probabilistic model
worst case
cost function
objective function
computational complexity
lot size
optimal solution
learning algorithm
monte carlo
special case
np hard
dynamic programming
simulated annealing
convex hull
knapsack problem
lower and upper bounds