The Computational Complexity of Integer Programming with Alternations.
Danny NguyenIgor PakPublished in: Math. Oper. Res. (2020)
Keyphrases
- integer programming
- computational complexity
- np hard
- np complete
- production planning
- linear programming
- ai planning
- constraint programming
- network flow
- set covering problem
- inference problems
- lagrangian relaxation
- special case
- column generation
- set covering
- cutting plane algorithm
- integer program
- lower bound
- decision problems
- cutting plane
- valid inequalities
- evaluation function
- bit rate
- layout design
- crew scheduling
- dantzig wolfe decomposition
- approximation algorithms
- transportation problem
- network design problem
- branch and bound algorithm
- set partitioning