A branch and bound approach for a class of non-convex problems with applications to robust regression.
Francesco DenaroLuca ConsoliniMarco LocatelliPublished in: MED (2017)
Keyphrases
- branch and bound
- randomly generated problems
- lower bound
- branch and bound algorithm
- combinatorial optimization
- branch and bound procedure
- search algorithm
- previously solved
- column generation
- robust regression
- branch and bound method
- optimal solution
- convex optimization problems
- upper bound
- optimization problems
- search space
- network design problem
- multi view
- image segmentation
- support vector