The computational complexity of integer programming with alternations.
Danny NguyenIgor PakPublished in: CoRR (2017)
Keyphrases
- integer programming
- computational complexity
- np hard
- production planning
- linear programming
- np complete
- special case
- constraint programming
- ai planning
- cutting plane
- set covering problem
- lagrangian relaxation
- column generation
- decision problems
- cutting plane algorithm
- inference problems
- facility location
- evaluation function
- valid inequalities
- linear programming relaxation
- network flow
- set partitioning
- integer program
- crew scheduling
- optimal solution
- dantzig wolfe decomposition
- vehicle routing problem with time windows
- transportation problem
- branch and bound algorithm
- network design problem
- set covering
- minimum cost
- approximation algorithms
- support vector