On a Finite Branch and Bound Algorithm for the Global Minimization of a Concave Power Law Over a Polytope.
Vasilios I. ManousiouthakisNeil ThomasAhmad M. JustanieahPublished in: J. Optim. Theory Appl. (2011)
Keyphrases
- branch and bound algorithm
- power law
- global minimization
- lower bound
- energy minimization
- global minimum
- branch and bound
- optimal solution
- upper bound
- np hard
- objective function
- combinatorial optimization
- small world
- scale free
- knapsack problem
- minimal cost
- lagrangian relaxation
- energy function
- cost function
- convex hull
- minimization problems
- linear programming
- image segmentation
- integer variables
- directed graph
- graph cuts