On the Algebraic Complexity of Integer Programming
Valentin E. BrimkovStefan S. DantchevPublished in: Electron. Colloquium Comput. Complex. (2000)
Keyphrases
- integer programming
- np hard
- linear programming
- constraint programming
- production planning
- ai planning
- facility location
- set covering problem
- network flow
- decision problems
- cutting plane
- inference problems
- valid inequalities
- lagrangian relaxation
- column generation
- computational complexity
- set covering
- cutting plane algorithm
- layout design
- set partitioning
- crew scheduling
- linear programming relaxation
- transportation problem
- linear program