Evolving binary constraint satisfaction problem instances that are difficult to solve

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 2, Issue , 2003, Pages 1267-1273

  Van Hemert, J I ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY; EVOLUTIONARY ALGORITHMS;

BINARY CONSTRAINT SATISFACTION; CONVENTIONAL METHODS; PROBLEM INSTANCES;

PROBLEM SOLVING;

EID: 24644518732     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299814     Document Type: Conference Paper

References (25)

1. Achlioptas, D., Kirousis, L., Kranakis, E., Krizanc, D., Molloy, M., and Stamatiou, Y. (2001). Random constraint satisfaction: A more accurate picture. Constraints, 4(6):329-344.
2. Bacchus, P. and van Beek, P. (1998). On the conversion between non-binary and binary constraint satisfaction problems. In Proceedings of the 15th International Conference on Artificial Intelligence. Morgan Kauf- mann.
3. Cheeseman, P., Kenefsky, B., and Taylor, W. M. (1991). Where the really hard problems are. In Proceedings of the IJCAI'91 pages 331-337.
4. Cohn, A. G., editor (1994). Proceedings of the European Conference on Artificial Intelligence. Wiley.
5. Dent, M. J. and Mercer, R. E. (1996). A new model of hard binary constraint satisfaction problems. In Proceedings of the Canadian Conference on AI 1996, pages 14-25.
6. Garey, M. and Johnson, D. (1979). Computers and Intractability: A Guide to the Theory of np- Completeness. W.H. Freedman and Co.
7. Gent, I. P., Maclntyre, E., Prosser, P., and Walsh, T. (1996). The constrainedness of search. In Proceedings of the AAAI-96, pages 246-252.
8. Golomb, S. and Baumert, L. (1965). Backtrack program-ming. A.C.M., 12(4);516-524.
9. van Hemert, J. (Version 1.7.0). Randomcsp: binary con-straint satisfaction problem generator. Freely available under the GNU Public License at http://freshmeat.net/projects/randomcsp.
10. van Hemert, J. and Back, T. (2002). Measuring the searched space to guide efficiency: The principle and evidence on constraint satisfaction. In Merelo, J., Panagious. A., Beyer, H.-G., Fernandez-Villacanas, J.-L., and Schwe- fel, H.-P., editors, Proceedings of the 7 th International Conference on Parallel Problem Solving from Nature, number 2439 in LNCS, pages 23-32, Berlin. Springer.
11. Hogg, T. (1996). Refining the phase transition in combinatorial search. Artificial Intelligence, 81:127-154.
12. Kratica, J., Ljubic, I., and Tosic, D. (2003). A genetic algo-rithm for the index selection problem. In et al., G. R, editor, Applications of Evolutionary Computation, volume 2611 of LNCS, pages 281-291. Springer-Verlag.
13. Kwan, A., Tsang, E., and Borrett, J. (1996). Predicting phase transitions of binary CSPs with local graph topology. In Wahlster, W., editor, 12th European Conference on Artificial Intelligence, pages 185-189.
14. Prosser, P. (1994). Binary constraint satisfaction problems: Some are harder than others. In (Cohn, 1994), pages 95-99.
15. Prosser, P. (1996). An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81:81-109.
16. Rossi, E, Petrie, C., and Dhar, V. (1990). On the equiv-alence of constraint satisfaction problems. In Aiello, L. C., editor, ECAl'90: Proceedings of the 9th European Conference on Artificial Intelligence, pages 550556, Stockholm. Pitman.
17. Slaney, J. and Walsh, T. (2001). Backbones in optimization and approximation. In Nebel, B., editor, Proceedings of the seventeenth International Conference on Artificial Intelligence (IJCAL-01), pages 254-259, San Francisco, CA. Morgan Kaufmann Publishers, Inc.
18. Smith, B. (1994). Phase transition and the mushy region in constraint satisfaction problems. In (Cohn, 1994), pages 100-104.
19. Smith, B. and Grant, S. (1994), Sparse constraint graphs and exceptionally hard problems. Technical Report RR 94.36, University of Leeds.
20. Smith, B. M. and Dyer, M. E. (1996). Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81 (1 -2): 155-181.
21. Smith, B. M. and Grant, S. A. (1997). Modelling exceptionally hard constraint satisfaction problems. In Smolka, G., editor. Principles and Practice of Constraint Pro-gramming- CP97, pages 182-195. Springer-Verlag.
22. Tsang, E. (1993). Foundations of Constraint Satisfaction. Academic Press.
23. Walsh, T. (2000). SAT v CSP. In Proceedings of the 6th Conference on Principles and Practice of Constraint Programming (CP 2000), pages 441-56.
24. Williams, C. and Hogg, T. (1994a). Exploiting the deep structure of constraint problems. Artificial Intelligence. 70:73-117.
25. Williams, C. and Hogg, T. (1994b). The hardest constraint problems: A double phase transition. Artificial Intelligence, 69:359-377.