An effective branch-and-bound algorithm for convex quadratic integer programming.
Christoph BuchheimAlberto CapraraAndrea LodiPublished in: Math. Program. (2012)
Keyphrases
- integer programming
- branch and bound algorithm
- np hard
- lagrangian relaxation
- set covering problem
- convex quadratic
- lower bound
- branch and bound
- linear programming
- upper bound
- max sat
- column generation
- combinatorial optimization
- optimal solution
- special case
- production planning
- inequality constraints
- worst case
- set covering
- cutting plane
- search space
- constraint programming
- linear program
- network flow
- approximation algorithms
- network design problem
- simulated annealing
- genetic algorithm