Compact representation of near-optimal integer programming solutions.
Thiago SerraJohn N. HookerPublished in: Math. Program. (2020)
Keyphrases
- integer programming
- np hard
- integer programming formulations
- linear programming
- production planning
- ai planning
- cutting plane algorithm
- cutting plane
- column generation
- compact representations
- valid inequalities
- structured representation
- integer program
- lagrangian relaxation
- constraint programming
- optimal solution
- linear programming relaxation
- set covering
- optimal or near optimal
- network design problem
- inference problems
- exact solution
- crew scheduling
- facility location
- round robin tournament
- computational complexity