A Branch and Bound algorithm for solving nonconvex minimization problem based on reducing duality gap.
Tingsong DuJingli YangPublished in: ICNC (2010)
Keyphrases
- branch and bound algorithm
- duality gap
- set covering problem
- combinatorial optimization
- lower bound
- finding an optimal solution
- objective function
- branch and bound
- optimal solution
- nonlinear programming
- np hard
- upper bound
- test problems
- optimization problems
- optimality conditions
- convex functions
- inequality constraints
- primal dual
- convex programming
- lagrangian relaxation
- simulated annealing
- linear programming
- max sat
- mathematical programming
- mixed integer linear programming
- augmented lagrangian
- metaheuristic
- variational inequalities
- linear programming problems
- linear constraints
- feasible solution
- traveling salesman problem
- search space