CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints.
Anselm PaulusMichal RolinekVít MusilBrandon AmosGeorg MartiusPublished in: ICML (2021)
Keyphrases
- integer programming
- np hard
- constraint programming
- integer program
- linear programming
- learning algorithm
- lagrangian relaxation
- round robin tournament
- cutting plane algorithm
- set covering
- network flow
- facility location
- integer programming formulations
- valid inequalities
- global constraints
- column generation
- metaheuristic
- optimal solution