Login / Signup
An algorithm for solving the multi-period online fulfillment assignment problem.
Stephen Mahar
Kurt M. Bretthauer
M. A. Venkataramanan
Published in:
Math. Comput. Model. (2009)
Keyphrases
</>
np hard
multi period
dynamic programming
search space
cost function
learning algorithm
probabilistic model
combinatorial optimization
computational complexity
worst case
linear programming
special case
objective function
simulated annealing
knapsack problem
lot sizing
reinforcement learning