Large final polynomials from integer programming.
Julian PfeiflePublished in: ACM Commun. Comput. Algebra (2021)
Keyphrases
- integer programming
- np hard
- lagrangian relaxation
- cutting plane
- linear programming
- column generation
- production planning
- cutting plane algorithm
- inference problems
- integer program
- constraint programming
- network flow
- ai planning
- vehicle routing problem with time windows
- transportation problem
- facility location
- layout design
- valid inequalities
- set covering problem
- set covering
- linear programming relaxation
- crew scheduling
- dantzig wolfe decomposition