Global constraints and filtering algorithms

Operations Research/ Computer Science Interfaces Series

Volumn 27, Issue , 2004, Pages 89-135

  Régin, Jean Charles ^a  

^a FLOG   (France)

Author keywords

Alldifferent; Arc consistency; Filtering algorithm; Global cardinality constraint; Global constraint; Global soft constraint; Graph theory; Matching; Over constrained problems

Indexed keywords

EID: 84888795993     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4419-8917-8     Document Type: Article

References (56)

1. Ahuja, R., Magnanti, T., and Orlin, I. (1993). Network Flows. Prentice Hall.
2. Baptiste, P., Le Pape, C., and Peridy, L. (1998). Global constraints for partial CSPs: A case-study of resource and due date constraints. In Proceedings of the International Conference on Pronciples and Practice of Constraint Programming, CP98, pages 87-101, Pisa, Italy.
3. Beldiceanu, N. (2001). Pruning for the minimum constraint family and for the number of distinct values constraint family. In Proceedings of the International Conference on Pronciples and Practice of Constraint Programming, CPO}, pages 211-224, Pathos, Cyprus.
4. Beldiceanu, N. and Carlsson, M. (2002). A new multi-resource cumulatives constraint with negative heights. In Proceedings of the International Conference on Pronciples and Practice of Constraint Programming, CP02, pages 63-79, Ithaca, NY, USA.
5. Beldiceanu, N. and Contejean, E. (1994). Introducing global constraints in chip. Journal of Mathematical and Computer Modelling, 20(12):97-123.
6. Beldiceanu, N., Guo, Q., and Thiel, S. (2001). Non-overlapping constraints between convex polytopes. In Proceedings of the International Conference on Pronciples and Practice of Constraint Programming, CPO}, pages 392407, Pathos, Cyprus.
7. Berge, C. (1970). Graphe et Hypergraphes. Dunod, Paris.
8. Bessiere, C.and Regin, J.-C. (1996). Mac and combined heuristics: Two reasons to forsake fc (and cbj?)on hard problems. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP96, pages 61-75, Cambridge, MA, USA.
9. Bessiere, C. and Regin, I.-C. (1997). Arc consistency for general constraint networks: preliminary results. In Proceedings of the International Joint Conference of Artificial Intelligence, IJCAI97, pages 398-404, Nagoya.
10. Bessiere, C. and Regin, I.-C. (1999). Enforcing arc consistency on global constraints by solving subproblems on the fly. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP99, pages 103-117, Alexandria, VA, USA.
11. Bessiere, C. and Regin, J.-CO (2001). Refining the basic constraint propagation algorithm. In Proceedings of International Joint Conference on Artificial Intelligence, JJCAIOl, pages 309-315, Seattle, WA, USA.
12. Bleuzen-Guernalec, N. and Colmerauer, A. (1997). Narrowing a 2n-block of sortings in o(nlog(n)). In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP97, pages 2-16, Linz, Austria.
13. Carlier, I. and Pinson, E. (1994). Adjustments of heads and tails for the jobshop problem. European Journal of Operational Research, 78:146-161.
14. Caseau, Y., Guillo, P.-Y., and Levenez, E. (1993). A deductive and objectoriented approach to a complex scheduling problem. In Proceedings of the International Conference on Deductive and Object-Oriented Databases DOOD'93.
15. Caseau, Y. and Laburthe, F. (1997). Solving various weighted matching problems with constraints. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP97, pages 17-31, Austria.
16. Damaschke, P., Miiller, H., and Kratsch, D. (1990). Domination in convex and chrodal bipartite graphs. Information Processing Letters, 36:231-236.
17. Dechter, R. (1992). From local to global consistency. Artificial Intelligence, 55:87-107.
18. Focacci, F., Lodi, A., and Milano, M. (1999a). Cost-based domain filtering. In Proceedings of the International Conference on Principles and Practice of Constraint Programming. CP99, pages 189-203, Alexandria, VA, USA.
19. Focacci, F., Lodi, A., and Milano, M. (1999b). Integration of CP and OR methods for matching problems. In Proceedings of the International Workshop on the Integration of Artificial Intelligence and Operations Research techniques in Constraint Programmingfor Combiantorial Optim ization, CP-AI-OR 99, Ferrara, Italy.
20. Henz, M., Miiller, T., and Thiel, S. (2003). Global constraints for round robin tournament scheduling. European Journal of Operational Research, To appear.
21. Hopcroft, J. and Karp, R. (1973). N5/ 2 algorithm for maximum matchings in bipartite graphs. SIAM Journal of Computing, 2:225-231.
22. ILOG (1999). ILOG Solver 4.4 User's manual. ILOG S.A.
23. Larrosa, J., Meseguer, P., Schiex, T., and Verfaillie, G. (1998). Reversible DAC and other improvements for solving MAX-CSP. Proceedings of the National Conference on Artificial Intelligence, AAAI, pages 347-352.
24. Lauriere, J.-L. (1978). A language and a program for stating and solving combinatorial problems. Artificial Intelligence, 10:29-127.
25. Lawler, E. (1976). Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston.
26. Leconte, M. (1996). A bounds-based reduction scheme for constraints of difference. In Constraint-96, Second International Workshop on Constraint-based Reasoning, Key West, FL, USA.
27. McAloon, K., Tretkoff, C., and Wetzel, G. (1997). Sports league scheduling. In Proceedings of ILOG user's conference, Paris.
28. Melhorn, K. and Thiel, S. (2000). Fasteralgorithms for bound-consistency of the sortedness and the alldifferent constraint. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP'00, pages 306-319, Singapore.
29. Micali, S. and Vazirani, V. (1980). An O(JfVIIEI)algorithm for finding maximum matching in general graphs. In Proceedings 21st FOCS, pages 17-27.
30. Montanari, U. (1974). Networks of constraints: Fundamental properties and applications to picture processing. Information Science, 7:95-132.
31. Pesant, G. (2001). Afilteringalgorithm for the stretch constraint. InProceedings of the International Conference on Principles and Practice of Constraint Programming, CP01, pages 183-195, Pathos, Cyprus.
32. Petit, T. (2002). Modelization and Algorithms for solving over-constrained Problems. PhD thesis, Universite de Montpellier II.
33. Petit, T., Regin, J.-C., and Bessiere, C. (2000). Meta constraints on violations for over-constrained problems. In Proceeding lCTAI-2000, pages 358-365.
34. Petit, T., Regin, J.-C., and Bessiere, C. (2001). Specific filtering algorithms for over-constrained problems. In Proceedings Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP01, pages 451-465, Pathos, Cyprus.
35. Petit, T., Regin, J.-C., and Bessiere, C. (2002). Range-based algorithms for MAX-CSP. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP02, pages 280-294, Ithaca, NY, USA.
36. Puget, J.-F. (1998). A fast algorithm for the bound consistency of alldiff constraints. In Proceedings of the National Conference on Artificial Intelligence, AAAI-98, pages 359-366, Menlo Park, USA.
37. Regin, J.-C. (1994). A filtering algorithm for constraints of difference in CSPs. In Proceedings of the National Conference on Artificial Intelligence, AAAI94, pages 362-367, Seattle, Washington.
38. Regin, J.-C. (1995). Developpement d'outils algorithmiques pour I'Intelligence Artificielle. Application ala chimie organique. PhD thesis, Universie de Montpellier II.
39. Regin, J-C. (1996). Generalized arc consistency for global cardinality constraint. In Proceedings AAAI-96, pages 209-215, Portland, Oregon.
40. Regin, J.-C. (1997). The global minimum distance constraint. Technical report, ILOG.
41. Regin, J.-C. (1999a). Arc consistency for global cardinality with costs. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP99, pages 390-404, Alexandria, VA, USA.
42. Regin, J.-C. (1999b). The symmetric alldiff constraint. In Proceedings of the International Joint Conference in Artificial Intelligence, JJCAI'99, pages 425-429, Stockholm, Sweden.
43. Regin, J.-C. (2002). Cost based arc consistency for global cardinality constraints. Constraints, an International Journal, 7(3-4):387-405.
44. Regin, J.-C., Petit, T, Bessiere, C., and Puget, J.-F. (2000). An original constraint based approach for solving over constrained problems. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CPOO, pages 543-548, Singapore.
45. Regin, J.-C., Petit, T., Bessiere, C., and Puget, J.-F. (2001). New lower bounds of constraint violations for over-constrained problems. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CPO], pages 332-345, Pathos, Cyprus.
46. Regin, J.-C. and Puget, J.-F. (1997). A filtering algorithm for global sequencing constraints. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP97, pages 32-46.
47. Regin, J.-C. and Rueher, M. (2000). A global constraint combining a sum constraint and difference constraints. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CPOO, pages 384-395, Singapore.
48. Rossi, F., Petrie, C., and Dhar, V. (1990). On the equivalence of constraint satisfaction problems. In Proceedings of the European Conference on Artificial Intelligence, ECAI'90, pages 550-556, Stockholm, Sweden.
49. Simonis, H. (1996). Problem classification scheme for finite domain constraint solving. In CP96, Workshop on Constraint Programming Applications: An Inventory and Taxonomy, pages 1-26, Cambridge, MA, USA.
50. Stergiou, K. and Walsh, T (1999). The difference all-difference makes. In Proceedings of the International joint Conference on Artificial Intelligence IJCAI99, pages 414-419, Stockholm, Sweden.
51. Tarjan, R. (1983). Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics.
52. Van Hentenryck, P. and Deville, Y. (1991). The cardinality operator: A new logical connective for constraint logic programming. In Proceedings of the International Conference on Logic Programming, ICLP-91, pages 745-759, Paris, France.
53. Van Hentenryck, P., Deville, Y., and Teng, C. (1992). A generic arc-consistency algorithm and its specializations. Artificial Intelligence, 57:291-321.
54. Van Hentenryck, P., Michel, L., L. Perron, and Regin, J.-C. (1999). Constraint programming in opl. In Proceedings of the International Conference on thePrinciples and Practice of Declarative Programming, PPDP 99, pages 98116, Paris, France.
55. Zhou, I. (1996). A constraint program for solving the job-shop problem. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP96, pages 510-524, Cambridge.
56. Zhou, I. (1997). Computing Smallest Cartesian Products of Intervals: Application to the Jobshop Scheduling Problem. PhD thesis, Universie de la Mediterranee, Marseille.