A GPU-based Branch-and-Bound algorithm using Integer-Vector-Matrix data structure.
Jan GmysMohand-Said MezmazNouredine MelabDaniel TuyttensPublished in: Parallel Comput. (2016)
Keyphrases
- branch and bound algorithm
- data structure
- integer variables
- lower bound
- branch and bound
- sparse matrix
- upper bound
- np hard
- combinatorial optimization
- optimal solution
- precedence constraints
- lower bounding
- randomly generated problems
- mixed integer linear programming
- search tree
- lagrangian relaxation
- rows and columns
- upper bounding
- variable ordering
- binary matrix
- finding an optimal solution
- bayesian networks
- single machine scheduling problem
- vector space
- feature vectors
- maximum clique
- max sat
- linear programming relaxation
- column generation
- index structure
- search space