1. Anjos, M.F.: An improved semidefinite programming relaxation for the satisfiability problem. Mathematical Programming 102(3), 589–608 (2005)
2. Anjos, M.F., Vannelli, A.: Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes. INFORMS Journal on Computing 20, 611–617 (2008)
3. Apt, K.R.: The essence of constraint propagation. Theoretical Computer Science 221(1–2), 179–210 (1999)
4. Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)
5. Brand, S., Duck, G.J., Puchinger, J., Stuckey, P.J.: Flexible, Rule-Based Constraint Model Linearisation. In: Hudak, P., Warren, D.S. (eds.) Practical Aspects of Declarative Languages, 10th International Symposium (PADL 2008), San Francisco, January 2008. Lecture Notes in Computer Science, vol. 4902, pp. 68–83. Springer, Heidelberg (2008)