Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs.
Nha Vo-ThanhRaf JansEric D. SchoenPeter GoosPublished in: Comput. Oper. Res. (2018)
Keyphrases
- mixed integer linear programming
- symmetry breaking
- experimental designs
- branch and bound algorithm
- search tree
- experimental design
- constraint programming
- cutting plane
- integer linear programming
- mathematical programming
- mixed integer
- learning tasks
- global constraints
- production planning
- combinatorial problems
- simulation platform
- graph coloring
- lower bound
- constraint satisfaction problems
- integer programming
- np hard
- symmetry breaking constraints
- sat solvers
- decision trees
- upper bound
- optimal solution
- branch and bound
- approximate solutions
- combinatorial optimization
- sample size
- training samples
- linear programming
- objective function