A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing.
Marco CasertaStefan VoßPublished in: Ann. Math. Artif. Intell. (2013)
Keyphrases
- lot sizing
- dantzig wolfe
- dynamic programming
- np hard
- mixed integer programming
- optimal solution
- cutting stock
- rolling horizon
- multistage
- computational complexity
- cost function
- simulated annealing
- metaheuristic
- linear programming
- dantzig wolfe decomposition
- bin packing
- multi item
- objective function
- particle swarm optimization
- search algorithm
- decomposition algorithm
- lower and upper bounds
- higher dimensional
- routing problem
- recognition algorithm
- combinatorial optimization