An Outcome Space Branch and Bound-Outer Approximation Algorithm for Convex Multiplicative Programming.
Harold P. BensonPublished in: J. Glob. Optim. (1999)
Keyphrases
- branch and bound
- search space
- optimal solution
- dynamic programming
- combinatorial optimization
- search algorithm
- branch and bound method
- np hard
- beam search
- worst case
- convex hull
- branch and bound algorithm
- cost function
- lower bound
- upper bound
- search strategy
- space complexity
- linear programming
- depth first search
- column generation
- lagrangian heuristic
- integer programming problems
- branch and bound procedure
- computational complexity
- branch and bound search
- tree decomposition
- approximation algorithms
- objective function
- simulated annealing
- constraint satisfaction problems