A Constraint Composite Graph-Based ILP Encoding of the Boolean Weighted CSP
The weighted constraint satisfaction problem (WCSP) occurs in the crux of many real-world applications of operations research, artificial intelligence, bioinformatics, etc. Despite its importance as a combinatorial substrate, many attempts for building an efficient WCSP solver have been largely unsatisfactory. In this paper, we introduce a new method for encoding a (Boolean) WCSP instance as an integer linear program (ILP). This encoding is based on the idea of the constraint composite graph (CCG) associated with a WCSP instance. We show that our CCG-based ILP encoding of the Boolean WCSP is significantly more efficient than previously known ILP encodings. Theoretically, we show that the CCG-based ILP encoding has a number of interesting properties. Empirically, we show that it allows us to solve many hard Boolean WCSP instances that cannot be solved by ILP solvers with previously known ILP encodings.
- 1.Berkelaar, M., Eikland, K., Notebaert, P.: lp_solve 5.5 open source (mixed integer) linear programming software (2004). http://lpsolve.sourceforge.net/5.5/
- 3.Gurobi Optimization Inc.: Gurobi optimizer reference manual (2017) http://www.gurobi.com
- 8.Kumar, T.K.S.: Lifting techniques for weighted constraint satisfaction problems. In: The International Symposium on Artificial Intelligence and Mathematics (2008)Google Scholar
- 9.Kumar, T.K.S.: Kernelization, generation of bounds, and the scope of incremental computation for weighted constraint satisfaction problems. In: The International Symposium on Artificial Intelligence and Mathematics (2016)Google Scholar
- 10.Marinescu, R., Dechter, R.: Best-first AND/OR search for graphical models. In: The AAAI Conference on Artificial Intelligence, pp. 1171–1176 (2007)Google Scholar
- 11.Siek, J., Lee, L.Q., Lumsdain, A.: The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley, Boston (2002)Google Scholar