Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization.
Gwenaël SamainSébastien BourguignonJordan NininPublished in: Optim. Methods Softw. (2024)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- branch and bound
- lower bound
- search tree
- upper bound
- set covering problem
- randomly generated
- optimization problems
- optimal solution
- sparse pca
- variable ordering
- optimization algorithm
- sparse representation
- boolean satisfiability
- finding an optimal solution
- haplotype inference
- dynamic optimization
- combinatorial problems
- np hard
- column generation
- mathematical programming
- simulated annealing