Outer approximations of core points for integer programming.
David BremnerNaghmeh ShahverdiPublished in: CoRR (2020)
Keyphrases
- constraint satisfaction
- integer programming
- constraint programming
- np hard
- linear programming
- lagrangian relaxation
- cutting plane
- column generation
- production planning
- set covering problem
- inference problems
- ai planning
- network flow
- cutting plane algorithm
- valid inequalities
- set covering
- vehicle routing problem with time windows
- crew scheduling
- facility location
- network design problem
- linear programming relaxation
- data points
- graph cuts
- upper bound
- evolutionary algorithm
- lower bound
- web services