Block-structured integer programming: Can we parameterize without the largest coefficient?
Hua ChenLin ChenGuochuan ZhangPublished in: Discret. Optim. (2022)
Keyphrases
- integer programming
- np hard
- linear programming
- column generation
- production planning
- ai planning
- lagrangian relaxation
- constraint programming
- integer program
- facility location
- inference problems
- dantzig wolfe decomposition
- cutting plane
- linear programming relaxation
- set covering problem
- layout design
- cutting plane algorithm
- crew scheduling
- integer programming formulations
- set covering
- valid inequalities
- network design problem
- computational complexity
- transportation problem
- optimal solution
- shortest path