A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems.
Takahito KunoHidetoshi NagaiPublished in: Comput. Optim. Appl. (2008)
Keyphrases
- branch and bound algorithm
- minimization problems
- lower bound
- branch and bound
- upper bound
- optimal solution
- np hard
- total variation
- cutting plane
- objective function
- combinatorial optimization
- lagrangian relaxation
- low rank
- image processing
- linear programming
- optimization problems
- dynamic programming
- evolutionary algorithm
- column generation
- search space