%Muhammad Shaaban + Muhammad E. Shaaban = identisch? Parallelization of a Maximum Parsimony Branch and Bound Algorithm.
Curtis HowardMuhammad ShaabanJuan CockbumLarry BuckleyPublished in: PDCS (2006)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- optimal solution
- np hard
- lower bounding
- precedence constraints
- combinatorial optimization
- randomly generated problems
- single machine scheduling problem
- mixed integer linear programming
- upper bounding
- branch and bound method
- finding an optimal solution
- variable ordering
- max sat
- maximum parsimony
- phylogenetic trees
- shared memory
- lagrangian relaxation
- multi dimensional
- probabilistic model
- special case
- neural network