A Gemometrical Bound for Integer Programming with Polynomial Constraints.
Bernd BankTeresa KrickReinhard MandelPablo SolernóPublished in: FCT (1991)
Keyphrases
- integer programming
- constraint programming
- integer program
- valid inequalities
- integer programming formulations
- np hard
- round robin tournament
- global constraints
- lagrangian relaxation
- linear programming
- column generation
- cutting plane
- ai planning
- set covering problem
- lower bound
- set covering
- cutting plane algorithm
- facility location
- constraint satisfaction
- upper bound
- network flow
- production planning
- worst case
- dantzig wolfe decomposition
- inference problems
- lp relaxation
- network design problem
- lower and upper bounds
- constraint satisfaction problems
- vehicle routing problem with time windows
- transportation problem
- genetic algorithm
- set partitioning
- crew scheduling
- ant colony optimization
- knapsack problem