A Distributed Branch-and-Bound Algorithm for Computing Optimal Coalition Structures.
Chattrakul SombattheeraAditya K. GhosePublished in: SETN (2006)
Keyphrases
- branch and bound algorithm
- computing optimal coalition structures
- lower bound
- branch and bound
- randomly generated
- lower bounding
- upper bound
- np hard
- search tree
- optimal solution
- test problems
- combinatorial optimization
- precedence constraints
- lagrangian relaxation
- variable ordering
- upper bounding
- mixed integer linear programming
- single machine scheduling problem
- search algorithm
- maximum clique
- finding an optimal solution
- bayesian networks
- max sat
- branch and bound method
- similarity measure
- integer programming
- search space