A Branch and Bound Method for a Clique Partitioning Problem.
Irène CharonOlivier HudryPublished in: CTW (2010)
Keyphrases
- branch and bound method
- branch and bound
- mixed integer programming
- lower bound
- branch and bound algorithm
- reduce the search space
- feasible solution
- optimal configuration
- search space
- maximum weight
- mixed integer
- optimal solution
- upper bound
- linear programming
- particle swarm optimization
- genetic algorithm
- scheduling problem
- np hard
- computational complexity
- decision making