New bounds on the unconstrained quadratic integer programming problem.
G. D. HalikiasImad M. JaimoukhaU. MalikS. K. GungahPublished in: J. Glob. Optim. (2007)
Keyphrases
- integer programming
- np hard
- lower bound
- constraint programming
- linear programming
- production planning
- upper bound
- cutting plane
- valid inequalities
- network flow
- objective function
- column generation
- computational complexity
- linear relaxation
- facility location
- lagrangian relaxation
- ai planning
- worst case
- set covering
- pairwise
- integer program
- set covering problem
- lower and upper bounds
- inference problems
- crew scheduling
- cutting plane algorithm
- transportation problem
- vehicle routing problem with time windows
- set partitioning
- integer programming formulations