Preprint
Aug 2026
Exploiting Structure in the Boolean Weighted Constraint Satisfaction Problem: A Constraint Composite Graph-Based Approach
This dissertation uses the CCG to kernelize a WCSP instance, fix optimal values of some variables by maxflow before search begins, improve min-sum message passing, exploit integer linear programming solvers, and solve COPs on quantum annealers.
Hong Xu
· 0 citations