Combining SOS with Branch and Bound to Isolate Global Solutions of Polynomial Optimization Problems.
Brendon K. ColbertHesameddin MohammadiMatthew M. PeetPublished in: ACC (2018)
Keyphrases
- branch and bound
- optimal solution
- optimization problems
- combinatorial optimization
- branch and bound algorithm
- lower bound
- search algorithm
- partial solutions
- column generation
- search space
- metaheuristic
- upper bound
- benchmark problems
- previously solved
- evolutionary algorithm
- branch and bound method
- objective function
- optimization criteria
- traveling salesman problem
- branch and bound procedure
- beam search
- tree search algorithm
- randomly generated problems
- branch and bound search
- tree search
- linear programming relaxation
- network design problem
- search strategies
- knapsack problem
- search methods
- integer programming problems
- cost function
- max sat
- linear programming
- lagrangian relaxation
- np hard
- simulated annealing
- neural network
- tabu search
- lagrangian heuristic