Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem.
Meinolf SellmannTorsten FahlePublished in: Ann. Oper. Res. (2003)
Keyphrases
- constraint programming
- lagrangian relaxation
- integer programming
- column generation
- combinatorial problems
- constraint propagation
- constraint satisfaction problems
- search strategies
- constraint satisfaction
- dual decomposition
- global constraints
- cutting plane algorithm
- cutting plane
- lower bound
- finite domain
- np hard
- branch and bound algorithm
- arc consistency
- constraint solver
- linear programming
- symmetry breaking
- dynamic programming
- search heuristics
- integer linear programming
- lower and upper bounds
- lagrangian heuristic
- constraint solving
- feasible solution
- special case
- branch and bound search
- single machine scheduling problem
- upper bound
- branch and bound
- data mining