On the Complexity of Quantified Integer Programming.
Dmitry ChistikovChristoph HaasePublished in: ICALP (2017)
Keyphrases
- integer programming
- constraint programming
- np hard
- set covering
- linear programming
- production planning
- cutting plane algorithm
- set covering problem
- facility location
- network flow
- layout design
- lagrangian relaxation
- computational complexity
- ai planning
- transportation problem
- worst case
- integer programming formulations
- crew scheduling
- inference problems
- column generation
- constraint satisfaction
- decision problems