CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints.
Anselm PaulusMichal RolínekVít MusilBrandon AmosGeorg MartiusPublished in: CoRR (2021)
Keyphrases
- integer programming
- np hard
- linear programming
- learning algorithm
- constraint programming
- integer program
- valid inequalities
- ai planning
- cutting plane algorithm
- column generation
- special case
- network flow
- lagrangian relaxation
- reinforcement learning
- vehicle routing problem with time windows
- transportation problem
- round robin tournament
- global constraints
- markov networks
- approximation algorithms
- optimal solution