Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem.
Alexander BelyiStanislav SobolevskyAlexander KurbatskiCarlo RattiPublished in: Math. Methods Oper. Res. (2023)
Keyphrases
- exact solution
- upper bound
- lower bound
- lower and upper bounds
- branch and bound
- pseudo boolean
- worst case
- upper and lower bounds
- branch and bound algorithm
- column generation
- numerical solution
- optimal solution
- np hard
- exact algorithms
- objective function
- approximate solutions
- constraint satisfaction
- efficiently computable
- sample complexity
- point correspondences
- genetic algorithm