Revision as of 09:14, 4 July 2024 edit N0099 (talk \| contribs) IP block exemptions 251 edits →Perturbation vs refinement models Tag: 2017 wikitext editor ← Previous edit		Revision as of 03:07, 24 July 2024 edit undo Kvng (talk \| contribs) Extended confirmed users, New page reviewers 115,948 edits m WP:ADOPTYPO Next edit →
Line 86: The constraints used in constraint programming are typically over some specific domains. Some popular domains for constraint programming are: * [[Boolean ~~datatype~~data type\|~~boolean~~Boolean]] domains, where only true/false constraints apply ([[Boolean satisfiability problem\|SAT problem]]) * [[integer]] domains, [[Rational numbers\|rational]] domains * [[Interval_(mathematics)\|interval]] domains, in particular for [[Automated planning and scheduling\|scheduling]] problems<ref>{{Cite book \|last1=Baptiste \|first1=Philippe \|url=https://books.google.com/books?id=qUzhBwAAQBAJ \|title=Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems \|last2=Pape \|first2=Claude Le \|last3=Nuijten \|first3=Wim \|date=2012-12-06 \|publisher=Springer Science & Business Media \|isbn=978-1-4615-1479-4 \|language=en}}</ref>

Constraint programming: Difference between revisions