Skip to main content
SpringerLink
Log in

Global Constraints and Filtering Algorithms

  • Chapter
Constraint and Integer Programming

Part of the book series: Operations Research/Computer Science Interfaces Series ((ORCS,volume 27))

Abstract

Constraint programming (CP) is mainly based on filtering algorithms; their association with global constraints is one of the main strengths of CP. This chapter is an overview of these two techniques. Some of the most frequently used global constraints are presented. In addition, the filtering algorithms establishing arc consistency for two useful constraints, the alldifferent and the global cardinality constraints, are fully detailed. Filtering algorithms are also considered from a theoretical point of view: three different ways to design filtering algorithms are described and the quality of the filtering algorithms studied so far is discussed. A categorization is then proposed. Over-constrained problems are also mentioned and global soft constraints are introduced.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Ahuja, R., Magnanti, T., and Orlin, J. (1993). Network Flows. Prentice Hall.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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, CP01, pages 211–224, Pathos, Cyprus.

    Google Scholar 

  • 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.

    Google Scholar 

  • Beldiceanu, N. and Contejean, E. (1994). Introducing global constraints in chip. Journal of Mathematical and Computer Modelling, 20(12): 97–123.

    Article  MATH  Google Scholar 

  • 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, CP01, pages 392–407, Pathos, Cyprus.

    Google Scholar 

  • Berge, C. (1970). Graphe et Hypergraphes. Dunod, Paris.

    Google Scholar 

  • Bessière, C. and Régin, 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.

    Google Scholar 

  • Bessière, C. and Régin, J.-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.

    Google Scholar 

  • Bessière, C. and Régin, J.-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.

    Google Scholar 

  • Bessière, C. and Régin, J.-C. (2001). Refining the basic constraint propagation algorithm. In Proceedings of International Joint Conference on Artificial Intelligence, IJCAI01, pages 309–315, Seattle, WA, USA.

    Google Scholar 

  • 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.

    Google Scholar 

  • Carlier, J. and Pinson, E. (1994). Adjustments of heads and tails for the jobshop problem. European Journal of Operational Research, 78:146–161.

    Article  MATH  Google Scholar 

  • Caseau, Y., Guillo, R.-Y., and Levenez, E. (1993). A deductive and object-oriented approach to a complex scheduling problem. In Proceedings of the International Conference on Deductive and Object-Oriented Databases DOOD’93.

    Google Scholar 

  • 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.

    Google Scholar 

  • Damaschke, P., Müller, H., and Kratsch, D. (1990). Domination in convex and chrodal bipartite graphs. Information Processing Letters, 36:231–236.

    Article  MathSciNet  MATH  Google Scholar 

  • Dechter, R. (1992). From local to global consistency. Artificial Intelligence, 55:87–107.

    Article  MathSciNet  MATH  Google Scholar 

  • 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.

    Google Scholar 

  • 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 Programming for Combiantorial Optimization, CP-AI-OR 99, Ferrara, Italy.

    Google Scholar 

  • Henz, M., Müller, T., and Thiel, S. (2003). Global constraints for round robin tournament scheduling, European Journal of Operational Research, To appear.

    Google Scholar 

  • Hopcroft, J. and Karp, R. (1973). n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal of Computing, 2:225–231.

    Article  MathSciNet  MATH  Google Scholar 

  • ILOG (1999). ILOG Solver 4.4 User’s manual ILOG S.A.

    Google Scholar 

  • Larrosa, J., Meseguer, P., Schiex, T., and Verfaillie, G. (1998). Reversible DAC and other improvements for solving MAX-CSR Proceedings of the National Conference on Artificial Intelligence, AAAI, pages 347–352.

    Google Scholar 

  • Laurière, J.-L. (1978). A language and a program for stating and solving combinatorial problems. Artificial Intelligence, 10:29–127.

    Article  MathSciNet  MATH  Google Scholar 

  • Lawler, E. (1976). Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston.

    MATH  Google Scholar 

  • 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.

    Google Scholar 

  • McAloon, K., Tretkoff, C, and Wetzel, G. (1997). Sports league scheduling. In Proceedings of ILOG user’s conference, Paris.

    Google Scholar 

  • Melhorn, K. and Thiel, S. (2000). Faster algorithms 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.

    Google Scholar 

  • Micali, S. and Vazirani, V. (1980). An \( O\left( {\sqrt {\left| V \right|} \left| E \right|} \right) \) algorithm for finding maximum matching in general graphs. In Proceedings 21st FOCS, pages 17–27.

    Google Scholar 

  • Montanari, U. (1974). Networks of constraints : Fundamental properties and applications to picture processing. Information Science, 7:95–132.

    Article  MathSciNet  MATH  Google Scholar 

  • Pesant, G. (2001). A filtering algorithm for the stretch constraint. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP01, pages 183–195, Pathos, Cyprus.

    Google Scholar 

  • Petit, T. (2002). Modelization and Algorithms for solving over-constrained Problems. PhD thesis, Université de Montpellier II.

    Google Scholar 

  • Petit, T., Régin, J.-C, and Bessière, C. (2000). Meta constraints on violations for over-constrained problems. In Proceeding ICTAI-2000, pages 358–365.

    Google Scholar 

  • Petit, T., Régin, J.-C, and Bessière, 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.

    Google Scholar 

  • Petit, T., Régin, J.-C., and Bessière, 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Régin, 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.

    Google Scholar 

  • Régin, J.-C. (1995). Développement d’outils algorithmiques pour I’Intelligence Artificielle. Application a la chimie organique. PhD thesis, Université de Montpellier II.

    Google Scholar 

  • Régin, J.-C. (1996). Generalized arc consistency for global cardinality constraint. In Proceedings AAAI-96, pages 209–215, Portland, Oregon.

    Google Scholar 

  • Régin, J.-C. (1997). The global minimum distance constraint. Technical report, ILOG.

    Google Scholar 

  • Régin, 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.

    Google Scholar 

  • Régin, J.-C. (1999b). The symmetric alldiff constraint. In Proceedings of the International Joint Conference in Artificial Intelligence, IJCAI’99, pages 425–429, Stockholm, Sweden.

    Google Scholar 

  • Régin, J.-C. (2002). Cost based arc consistency for global cardinality con-straints. Constraints, an International Journal, 7(3–4):3–4.

    Article  MathSciNet  MATH  Google Scholar 

  • Régin, J.-C., Petit, T., Bessière, 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, CP00, pages 543–548, Singapore.

    Google Scholar 

  • Régin, J.-C., Petit, T., Bessière, 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, CP0I, pages 332–345, Pathos, Cyprus.

    Google Scholar 

  • 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.

    Google Scholar 

  • Régin, J.-C. and Rueher, M. (2000). A global constraint combining a sum constraint and difference constraints. In Proceedings of the International Constraint on Principles and Practice of Constraint Programming, CP00, pages 384–395, Singapore.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Stergiou, K. and Walsh, T. (1999). The difference all-difference makes. In Proceedings of the International joint Conference on Artificial Intelligence IJ-CAI99, pages 414–419, Stockholm, Sweden.

    Google Scholar 

  • Tarjan, R. (1983). Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics.

    Google Scholar 

  • 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.

    Google Scholar 

  • Van Hentenryck, P., Deville, Y., and Teng, C. (1992). A generic arc-consistency algorithm and its specializations. Artificial Intelligence, 57:291–321.

    Article  MathSciNet  MATH  Google Scholar 

  • Van Hentenryck, P., Michel, L., L.Perron, and Régin, J.-C. (1999). Constraint programming in opl. In Proceedings of the International Conference on the Principles and Practice of Declarative Programming, PPDP 99, pages 98–116, Paris, France.

    Google Scholar 

  • Zhou, J. (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.

    Google Scholar 

  • Zhou, J. (1997). Computing Smallest Cartesian Products of Intervals: Application to the Jobshop Scheduling Problem. PhD thesis, Université de la Méditerranée, Marseille.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ILOG, 1681, route des Dolines, Sophia Antipolis, Valbonne, 06560, France

    Jean-Charles Régin

Authors
  1. Jean-Charles Régin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Bologna, Bologna, Italy

    Michela Milano

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Science+Business Media New York

About this chapter

Cite this chapter

Régin, JC. (2004). Global Constraints and Filtering Algorithms. In: Milano, M. (eds) Constraint and Integer Programming. Operations Research/Computer Science Interfaces Series, vol 27. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8917-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-8917-8_4

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-4719-4

  • Online ISBN: 978-1-4419-8917-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation