Quadratic Outer Approximation for Convex Integer Programming with Box Constraints.
Christoph BuchheimLong TrieuPublished in: SEA (2013)
Keyphrases
- integer programming
- constraint programming
- integer program
- constrained minimization
- round robin tournament
- valid inequalities
- penalty functions
- column generation
- global constraints
- convex functions
- integer programming formulations
- linear programming
- np hard
- ai planning
- cutting plane
- gaussian convolution
- inference problems
- cutting plane algorithm
- linear programming relaxation
- set covering problem
- lp relaxation
- constraint satisfaction
- quadratic function
- approximation algorithms
- quadratic program
- pairwise
- constraint satisfaction problems
- linear program
- set covering
- facility location
- network flow
- transportation problem
- convex optimization
- objective function
- lagrangian relaxation
- production planning
- vehicle routing problem with time windows
- semidefinite
- set partitioning
- crew scheduling
- dantzig wolfe decomposition
- linear constraints
- convex sets