Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints.
Monique GuignardPublished in: Ann. Oper. Res. (2020)
Keyphrases
- linear constraints
- lagrangean relaxation
- linear programming relaxation
- lower bound
- quadratic optimization problems
- linear relaxation
- column generation
- valid inequalities
- upper bound
- linear programming
- set partitioning
- branch and bound
- knapsack problem
- integer programming
- linearly constrained
- lower and upper bounds
- mixed integer programming
- branch and bound algorithm
- feasible solution
- optimal solution
- constant factor
- linear program
- np hard
- convex sets
- np complete
- lagrangian relaxation
- cutting plane
- semidefinite programming
- data points
- maximum likelihood