Extensions on ellipsoid bounds for quadratic integer programming.
Marcia FampaFrancisco Pinillos NietoPublished in: J. Glob. Optim. (2018)
Keyphrases
- integer programming
- np hard
- upper bound
- lower bound
- production planning
- linear programming
- lagrangian relaxation
- worst case
- constraint programming
- column generation
- network flow
- set covering problem
- facility location
- computational complexity
- cutting plane
- objective function
- set covering
- transportation problem
- ai planning
- cutting plane algorithm
- integer programming formulations
- lower and upper bounds
- crew scheduling
- integer program
- valid inequalities
- vehicle routing problem with time windows
- pairwise
- reinforcement learning
- linear relaxation
- dantzig wolfe decomposition
- linear programming relaxation
- convex optimization
- inference problems
- minimum volume