On the Complexity of Integer Programming with Fixed-Coefficient Scaling (Short Paper).
Jorke M. de VlasPublished in: CP (2024)
Keyphrases
- integer programming
- np hard
- constraint programming
- column generation
- linear programming
- ai planning
- network flow
- set covering problem
- cutting plane
- transportation problem
- layout design
- production planning
- inference problems
- computational complexity
- set partitioning
- set covering
- valid inequalities
- worst case
- linear programming relaxation
- integer program
- lagrangian relaxation
- crew scheduling
- dantzig wolfe decomposition
- lower bound
- cutting plane algorithm
- facility location
- decision problems
- integer programming formulations