Sparse Branch and Bound for Exact Optimization of L0-Norm Penalized Least Squares.
Ramzi Ben MhenniSébastien BourguignonMarcel MongeauJordan NininHervé CarfantanPublished in: ICASSP (2020)
Keyphrases
- branch and bound
- least squares
- combinatorial optimization
- branch and bound algorithm
- lower bound
- search algorithm
- sparse linear
- upper bound
- optimal solution
- optimization problems
- search space
- column generation
- branch and bound procedure
- mini bucket
- tree search
- branch and bound method
- tree search algorithm
- network design problem
- randomly generated problems
- optical flow
- integer programming problems
- beam search
- objective function
- mathematical programming
- branch and bound search
- linear program
- partial solutions
- metaheuristic
- genetic algorithm