Constraint programming

Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques

Volumn , Issue , 2005, Pages 239-272

  Freuder, Eugene C ^a   Wallace, Mark ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b MONASH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 60449103262     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/0-387-28356-0_9     Document Type: Chapter

References (52)

1. Amilhastre, J., Fargier, H. and Marquis, P., 2002, Consistency restoration and explanations in dynamic CSPs-Application to configuration, Artif. Intell. 135:199-234.
2. Bacchus, F., Chen, X., Van Beek, P. and Walsh, T., 2002, Binary vs non-binary constraints, Artif. Intell. 140:1-37.
3. Bessiere, C, Freuder, E. and Regin, J., 1999, Using constraint metaknowledge to reduce arc consistency computation, Artif. Intell. 107:125-148.
4. Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T. and Verfaille, G., 1996, Semiring-based CSPs and valued CSPs: Basic properties, in: Over-Constrained Systems, Lecture Notes in Computer Science, Vol. 1106, M. Jampel, E. C. Freuder, and M. Maher, eds, Springer, Berlin, pp. 111-150.
5. Cheng, B., Choi, K., Lee, J. and Wu, J., 1999, Increasing constraint propagation by redundant modeling: an experience report, Constraints 4:167-192.
6. Cheeseman, P., Kanefsky, B. and Taylor, W., 1991, Where the really hard problems are, in: Proc. 12th Int. Joint Conf. in Artificial Intelligence, Morgan Kaufmann, San Mateo, CA, pp. 331-337.
7. www.mat.univie.ac.at/~neum/glopt/coconut
8. www.informs.org/Conf/CORS-INFORMS2004
9. www-sop.inria.fr/coprin/cpaior04
10. Debruyne, R. and Bessiere, C, 2001, Domain filtering consistencies, J. Artif. Intell. Res. 14:205-230.
11. Dechter, R., 1990, Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition, Artif. Intell. 41:273-312.
12. Dechter, R., 2003, Constraint Processing, Morgan Kaufmann, San Mateo, CA.
13. Dechter, R. and Frost, D., 2002, Backjump-based backtracking for constraint satisfaction problems, Artif. Intell. 136:147-188.
14. De Givry, S. and Jeannin, L., 2004, A Library for Partial and Hybrid Search Methods, www.crt.umontreal.ca/cpaior
15. Deransart, P., Hermenegildo, M. and Maluszynski, J., eds, 2000, Analysis and Visualization Tools for Constraint Programming, Lecture Notes in Computer Science, Vol. 1870, Springer, Berlin.
16. Dechter, R., Meiri, I. and Pearl, J., 1991, Temporal constraint networks, Artif. Intell. 49:61-95.
17. www.icparc.ic.ac.uk/eclipse
18. Freuder, E., 1978, Synthesizing constraint expressions, Commun. ACM 11:958-966.
19. Freuder, E., 1982, A sufficient condition for backtrack-free search, J. Assoc. Comput. Mach. 29:24-32.
20. Freuder, E., 1991, Eliminating interchangeable values in constraint satisfaction problems, in: Proc. 9th Natl Conf. on Artificial Intelligence, AAAI/MIT Press, Menlo Park, CA, pp. 227-233.
21. Gomes, C, Selman, B. and Crato, N., 1997, Heavy-tailed distributions in combinatorial search, in: Proc. 3rd Int. Conf. on Principles and Practice of Constraint Programming (CP'97), Lecture Notes in Computer Science, Vol. 1330, G. Smolka, ed., Springer, Berlin, pp. 121-135.
22. Harvey, W. and Ginsberg, M., 1995, Limited discrepancy search, in: Proc. 14th Int. Joint Conf. on Artificial Intelligence (IJCAI-95). Morgan Kaufmann, San Mateo, CA, pp. 607-615.
23. Jeavons, P., Cohen, D. and Gyssens, M., 1997, Closure properties of constraints, J. ACM 44:527-548.
24. Jaffar, J. and Lassez, J.-L., 1987, Constraint logic programming, in: Proc. Ann. ACM Symp. on Principles of Programming Languages (POPL), pp. 111-119.
25. Kondrak, G. and Van Beek, P., 1997, A theoretical evaluation of selected backtracking algorithms, Artif. Intell. 89:365-387.
26. Laburthe, F. and Caseau, Y., 1998, SALSA: A language for search algorithms, in: Proc. 4th Int. Conf. on the Principles and Practice of Constraint Programming (CP'98), Pisa, Italy, Lecture Notes in Computer Science, Vol. 1520, Springer, Berlin, pp. 310-324.
27. Mackworth, A., 1977, Consistency in networks of relations, Artif. Intell. 8:99-118.
28. Minton, S., 1996, Automatically configuring constraint satisfaction programs: A case study, Constraints 1:7-43.
29. Minton, S., Johnston, M. D., Philips, A. B. and Laird, P., 1992, Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling, Artif. Intell. 58:61-205.
30. Michel, L. and Van Hentenryck, P., 1999, Localizer: a modeling language for local search, INFORMS, J. Comput. 11:1-14.
31. Regin, J.-C, 1994, A filtering algorithm for constraints of difference in CSPs, in: Proc. AAAI 12th Natl Conf. on Artificial Intelligence, AAAI Press, Menlo Park, CA, pp. 362-367.
32. Regin, J.-C, 2001, Minimization of the number of breaks in sports scheduling problems using constraint programming, in: Constraint Programming and Large Scale Discrete Optimization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 57, E. Freuder and R. Wallace, eds, American Mathematical Society, Providence, RI, pp. 115-130.
33. Sabin, D. and Freuder, E., 1997, Understanding and Improving the MAC Algorithm, in: Proc. 3rd Int. Conf. on Principles and Practice of Constraint Programming (CP'97), Lecture Notes in Computer Science, Vol. 1330, G. Smolka, ed., Springer, Berlin, pp. 167-181.
34. Selman, B., Levesque, H. and Mitchell, D., 1992, A new method for solving hard satisfiability problems, in: Proc. 10th Natl Conf. on Artificial Intelligence (AAAI-92), San Jose, CA, pp. 440-446.
35. Tsang, E., 1993, Foundations of Constraint Satisfaction, Academic, London.
36. Van Hentenryck, P., 1999, The OPL Optimization Programming Language, MIT Press, Cambridge, MA.
37. Van Hentenryck, P., Simonis, H. and Dincbas, M., 1992, Constraint satisfaction using constraint logic programming, Artif Intell. 58:113-159.
38. Veron, A., Schuerman, K., Reeve, M. and Li, L.-L., 1993, Why and How in the ElipSys OR-Parallel CLP System, in: Proc. 5th Int. PARLE Conf, pp. 291-303.
39. Walsh, T., 2002, Stochastic constraint programming, in: Proc. 15th ECAI, F. van Harmelen, ed., pp. 111-115.
40. Yokoo, M., Durfee, E., Ishida, T. and Kuwabara, K., 1998, The distributed CSP: Formalization and algorithms, IEEE Trans, on Knowledge and Data Engineering 10:673-685.
41. Zhang, W., 1998, Complete anytime beam search, in: Proc. 15th Natl Conf. on Artificial Intelligence (AAAI-98), pp. 425-430.
42. Babu, B. and Jehan, M. M. L., 2003, Differential evolution for multiobjective optimization, in: Proc. 2003 Congress on Evolutionary Computation (CEC'2003), Canberra, Australia, Vol. 4, IEEE, Piscataway, NJ, pp. 2696-2703.
43. Bagchi, T., 1999, Multiobjective Scheduling by Genetic Algorithms, Kluwer, Boston, MA.
44. Balicki, J. and Kitowski, Z., 2001, Multicriteria evolutionary algorithm with tabu search for task assignment, in: Proc. 1st Int. Conf. on Evolutionary Multi-Criterion Optimization (EMO-01), pp. 373-384.
45. Bleuler, S., Brack, M. and Zitzler, E., 2001, Multiobjective genetic programming: Reducing bloat using spea2, in: Proc. 2001 Congress on Evolutionary Computation, pp. 536-543.
46. Chankong, V. and Haimes, Y. Y., 1983, Multiobjective Decision Making Theory and Methodology, North-Holland, New York.
47. Chattopadhyay, A. and Seeley, C, 1994, A simulated annealing technique for multi-objective optimization of intelligent structures, Smart Mater. Struct. 3:98-106.
48. Coello, C. A. C, 2000, Treating objectives as constraints for single objective optimization, Eng. Optim. 32:275-308.
49. Coello, C. A. C, 2003, http://www.lania.mx/ccoello/EMOO/+
50. Coello, C. A. C. and Toscano, G., 2000, A micro-genetic algorithm for multiobjective optimization, Technical Report Lania-RI-2000-06, Laboratoria Nacional de Informatica Avanzada, Xalapa, Veracruz, Mexico.
51. Coello, C. A. C, Van Veldhuizen, D. A. and Lamont, G., 2002, Evolutionary Algorithms for Solving Multi-Objective Problems, Kluwer, Boston, MA.
52. Coello Coello, C. A. and Salazar Lechuga, M., 2002, MOPSO: A Proposal for Multiple Objective Particle Swarm Optimization, in: Congress on Evolu-tionary Computation (CEC'2002).