Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems.
Thai Quynh PhongLe Thi Hoai AnPham Dinh TaoPublished in: Oper. Res. Lett. (1995)
Keyphrases
- linearly constrained
- minimization problems
- branch and bound method
- linear constraints
- variational inequalities
- total variation
- branch and bound
- branch and bound algorithm
- mixed integer programming
- lower bound
- optimal configuration
- reduce the search space
- low rank
- feasible solution
- primal dual
- interior point
- convex optimization
- knapsack problem
- combinatorial optimization
- denoising
- upper bound
- pairwise