The Computational Complexity of Integer Programming with Alternations.
Danny NguyenIgor PakPublished in: Computational Complexity Conference (2017)
Keyphrases
- integer programming
- computational complexity
- np hard
- constraint programming
- production planning
- linear programming
- ai planning
- cutting plane algorithm
- cutting plane
- decision problems
- column generation
- special case
- network flow
- valid inequalities
- np complete
- set covering problem
- set covering
- lagrangian relaxation
- inference problems
- facility location
- crew scheduling
- integer program
- optimal solution
- approximation algorithms
- vehicle routing problem with time windows
- lower bound
- evaluation function
- network design problem
- minimum cost
- layout design
- round robin tournament