Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times.
Meltem DenizelF. Tevhide AltekinHaldun SüralHartmut StadtlerPublished in: OR Spectr. (2008)
Keyphrases
- setup times
- multi item
- lp relaxation
- scheduling problem
- valid inequalities
- single machine scheduling problem
- lot sizing
- lagrangian relaxation
- linear programming
- processing times
- single machine
- flowshop
- integer programming
- feasible solution
- parallel machines
- linear program
- message passing
- precedence constraints
- integer program
- optimal solution
- mixed integer
- traveling salesman problem
- energy minimization
- tabu search
- global constraints
- genetic algorithm
- graphical models
- probabilistic model
- evolutionary algorithm
- knapsack problem