A complete characterization of complexity for Boolean constraint optimization problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3258, Issue , 2004, Pages 212-226

  Cohen, David ^a   Cooper, Martin ^b   Jeavons, Peter ^c  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b IRIT   (France)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINED OPTIMIZATION; CONSTRAINT THEORY; OPTIMIZATION;

BOOLEAN CONSTRAINT; BOOLEAN VARIABLES; DICHOTOMY THEOREM; MAX-SAT; OPTIMIZATION PROBLEMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 33646178984     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_18     Document Type: Article

References (12)

1. Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G.: Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison. Constraints 4 (1999) 199-240
2. Creignou, N., Khanna, S., Sudan, M.: Complexity Classification of Boolean Constraint Satisfaction Problems. Volume 7 of SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics (2001)
3. Schaefer, T.: The complexity of satisfiability problems. In: Proceedings 10th ACM Symposium on Theory of Computing, STOC'78. (1978) 216-226
4. Cohen, D., Cooper, M., Jeavons, P., Krokhin, A.: Soft constraints: complexity and multimorphisms. In: Proceedings of 9th International Conference on Principles and Practice of Constraint Programming (CP'03). Volume 2833 of Lecture Notes in Computer Science., Springer-Verlag (2003) 244-258
5. Bulatov, A., Krokhin, A., Jeavons, P.: Constraint satisfaction problems and Finite algebras. In: Proceedings ICALP'00. Volume 1853 of Lecture Notes in Computer Science., Springer-Verlag (2000) 272-282
6. Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. Journal of the ACM 44 (1997) 527-548
7. Jeavons, P.: On the algebraic structure of combinatorial problems. Theoretical Computer Science 200 (1998) 185-204
8. Pöschel, R., Kalužnin, L.: Funktionen- und Relationenalgebren. DVW, Berlin (1979)
9. Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley & Sons (1988)
10. Jeavons, P., Cohen, D., Cooper, M.: Constraints, consistency and closure. Artificial Intelligence 101 (1998) 251-265
11. Iwata, S.: A faster scaling algorithm for minimizing submodular functions. SIAM Journal on Computing 32 (2003) 833-840
12. Cohen, D., Cooper, M., Jeavons, P., Krokhin, A.: An investigation of the multimorphisms of tractable and intractable classes of valued constraints. Technical Report CSD-TR-03-03, CS department, Royal Holloway, University of London (2003)