On the computational complexities of Quantified Integer Programming variants.
Piotr J. WojciechowskiK. SubramaniPavlos EirinakisPublished in: ISAIM (2016)
Keyphrases
- integer programming
- cutting plane
- integer programming formulations
- np hard
- linear programming
- production planning
- constraint programming
- cutting plane algorithm
- set covering problem
- valid inequalities
- lagrangian relaxation
- families of valid inequalities
- integer program
- network flow
- ai planning
- inference problems
- crew scheduling
- column generation
- lower bound
- dantzig wolfe decomposition
- set partitioning
- dynamic programming
- set covering
- facility location
- linear programming relaxation
- exact methods
- vehicle routing problem with time windows
- network design problem
- special case