An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming.
Christoph BuchheimAlberto CapraraAndrea LodiPublished in: IPCO (2010)
Keyphrases
- integer programming
- branch and bound algorithm
- np hard
- lagrangian relaxation
- set covering problem
- convex quadratic
- lower bound
- branch and bound
- optimal solution
- linear programming
- upper bound
- network flow
- constraint programming
- column generation
- cutting plane
- production planning
- np complete
- integer program
- set covering
- combinatorial problems
- special case
- approximation algorithms
- linear programming relaxation
- exact methods
- computational complexity