Subnetwork Constraints for Tighter Upper Bounds and Exact Solution of the Clique Partitioning Problem.
Alexander BelyiStanislav SobolevskyAlexander KurbatskiCarlo RattiPublished in: CoRR (2021)
Keyphrases
- exact solution
- upper bound
- lower bound
- lower and upper bounds
- pseudo boolean
- upper and lower bounds
- branch and bound algorithm
- exact algorithms
- np hard
- numerical solution
- column generation
- branch and bound
- worst case
- optimal solution
- constraint programming
- approximate solutions
- linear programming relaxation
- efficiently computable
- orthogonal projection
- sample complexity
- camera calibration
- high dimensional
- objective function
- dynamic programming
- reinforcement learning