A Combined D.C. Optimization - Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming Problems.
Le Thi Hoai AnPham Dinh TaoLe Dung MuuPublished in: J. Comb. Optim. (1998)
Keyphrases
- branch and bound algorithm
- quadratic programming problems
- combinatorial optimization
- nonlinear programming
- equality constraints
- optimization problems
- lower bound
- branch and bound
- optimal solution
- finding an optimal solution
- systems of linear equations
- global optimization
- upper bound
- np hard
- variable ordering
- test problems
- linear programming
- support vector machine
- linear constraints
- mixed integer linear programming
- metaheuristic
- max sat
- integer variables
- upper bounding
- convex optimization
- simulated annealing
- objective function
- variational inequalities
- evolutionary algorithm
- traveling salesman problem
- optimization methods
- decomposition algorithm
- search algorithm
- knapsack problem