A Branch-And-Bound Algorithm for Cluster Editing.
Thomas BläsiusPhilipp FischbeckLars GottesbürenMichael HamannTobias HeuerJonas SpinnerChristopher WeyandMarcus WilhelmPublished in: SEA (2022)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- optimal solution
- test problems
- np hard
- randomly generated
- lower bounding
- search tree
- randomly generated problems
- combinatorial optimization
- lagrangian relaxation
- finding an optimal solution
- variable ordering
- mixed integer linear programming
- precedence constraints
- clustering algorithm
- upper bounding
- single machine scheduling problem
- maximum clique
- max sat
- branch and bound method
- approximation algorithms
- search algorithm
- linear program