SDP-based branch-and-bound for non-convex quadratic integer optimization.
Christoph BuchheimMaribel MontenegroAngelika WiegelePublished in: J. Glob. Optim. (2019)
Keyphrases
- branch and bound
- convex quadratic
- combinatorial optimization
- lower bound
- branch and bound algorithm
- search algorithm
- upper bound
- column generation
- optimal solution
- search space
- branch and bound procedure
- inequality constraints
- tree search
- network design problem
- optimization problems
- constrained optimization
- neural network
- max sat
- semidefinite programming
- linear programming
- np hard
- nonlinear programming
- convex programming
- simulated annealing
- multiple objectives
- cost function
- traveling salesman problem
- heuristic search
- metaheuristic
- exact algorithms
- decision variables
- optimization algorithm