Work stealing with private integer-vector-matrix data structure for multi-core branch-and-bound algorithms.
Jan GmysRudi LeroyMohand MezmazNouredine MelabDaniel TuyttensPublished in: Concurr. Comput. Pract. Exp. (2016)
Keyphrases
- branch and bound algorithm
- data structure
- integer variables
- lower bound
- branch and bound
- upper bound
- sparse matrix
- search tree
- combinatorial optimization
- optimal solution
- randomly generated
- np hard
- set covering problem
- finding an optimal solution
- max sat
- search algorithm
- haplotype inference
- combinatorial problems
- rows and columns
- variable ordering
- main memory
- b tree
- metaheuristic
- binary matrix