Strong valid inequalities for Boolean logical pattern generation.
Kedong YanHong Seo RyooPublished in: J. Glob. Optim. (2017)
Keyphrases
- pattern generation
- valid inequalities
- integer programming
- traveling salesman problem
- mixed integer programming
- cutting plane algorithm
- mixed integer linear programs
- linear programming
- cutting plane
- mixed integer
- feasible solution
- network design problem
- lower and upper bounds
- convex hull
- column generation
- linear programming relaxation
- integer programming formulation
- integer program
- primal dual
- lower bound
- cellular automaton
- lagrangian relaxation
- boolean functions
- facet defining inequalities
- bayesian networks
- lot sizing
- randomly generated
- dynamic systems
- cellular automata
- ant colony optimization
- np hard