Superadditive characterizations of pure integer programming feasibility.
Amin DehghanianAndrew J. SchaeferPublished in: Optim. Lett. (2016)
Keyphrases
- integer programming
- linear programming
- np hard
- column generation
- ai planning
- production planning
- constraint programming
- cutting plane
- set covering problem
- cutting plane algorithm
- set covering
- layout design
- network flow
- transportation problem
- lagrangian relaxation
- crew scheduling
- valid inequalities
- facility location
- dantzig wolfe decomposition
- inference problems
- upper bound
- linear programming relaxation
- integer program