Sign in
An algorithm using Lagrangean relaxation and decomposition for solving a capacitated lot-sizing problem.
Chun-Hung Cheng
Manohar S. Madan
Angappa Gunasekaran
Ka-Yun Yip
Published in:
Int. J. Math. Oper. Res. (2010)
Keyphrases
</>
dynamic programming
k means
cost function
expectation maximization
learning algorithm
objective function
optimal solution
computational complexity
evolutionary algorithm
search space
simulated annealing
decomposition algorithm