Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem.
Gautam AppaIoannis MourtosDimitris MagosPublished in: CP (2002)
Keyphrases
- integer programming
- global constraints
- np hard
- constraint programming
- cutting plane
- valid inequalities
- linear programming
- production planning
- ai planning
- network flow
- inference problems
- column generation
- lagrangian relaxation
- integer program
- set covering problem
- cutting plane algorithm
- crew scheduling
- facility location
- set covering
- set partitioning
- linear constraints
- dantzig wolfe decomposition
- lower bound
- layout design
- upper bound
- special case