On the separation of split inequalities for non-convex quadratic integer programming.
Christoph BuchheimEmiliano TraversiPublished in: Discret. Optim. (2015)
Keyphrases
- integer programming
- convex quadratic
- valid inequalities
- cutting plane algorithm
- inequality constraints
- np hard
- round robin tournament
- linear programming
- constraint programming
- network flow
- column generation
- cutting plane
- lagrangian relaxation
- linear programming relaxation
- lp relaxation
- interior point methods
- sufficient conditions
- integer program
- feature space