A branch-and-bound multi-parametric programming approach for non-convex multilevel optimization with polyhedral constraints.
Abay Molla KassaSemu Mitiku KassaPublished in: J. Glob. Optim. (2016)
Keyphrases
- branch and bound
- combinatorial optimization
- column generation
- lower bound
- search algorithm
- branch and bound algorithm
- dual variables
- constrained optimization
- feasible set
- search space
- upper bound
- optimal solution
- convex hull
- partial solutions
- branch and bound method
- convex sets
- optimization problems
- branch and bound procedure
- multiple knapsack
- inequality constraints
- mini bucket
- objective function
- convex optimization
- decision variables
- linear constraints
- quadratically constrained quadratic
- tree search
- integer program
- beam search
- convex relaxation
- tree search algorithm
- randomly generated problems
- branch and bound search
- integer programming problems
- lower and upper bounds
- neural network
- traveling salesman problem
- knapsack problem
- nonlinear programming
- convex programming
- simulated annealing
- constraint satisfaction
- network design problem
- metaheuristic
- constraint programming
- linear programming relaxation
- max sat
- variational inequalities
- vehicle routing problem