A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem.
Ioannis T. ChristouSpyridon VassilarasPublished in: Comput. Oper. Res. (2013)
Keyphrases
- branch and bound
- maximum distance
- search algorithm
- parallel tree search
- search space
- branch and bound algorithm
- mini bucket
- lower bound
- depth first search
- upper bound
- column generation
- optimal solution
- randomly generated problems
- branch and bound procedure
- branch and bound method
- network design problem
- beam search
- max sat
- tree search algorithm
- shared memory
- branch and bound search
- tree search
- combinatorial optimization
- lagrangian heuristic
- reduction method
- data points
- optimization problems
- greedy algorithm
- heuristic search
- simulated annealing
- cost function
- search tree
- constraint satisfaction problems
- high dimensional
- feature selection