Revision as of 14:48, 12 August 2005 edit 137.204.45.208 (talk) No edit summary ← Previous edit		Revision as of 15:45, 18 August 2005 edit undo Elkman (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 32,485 edits Add a link to the INFORMS article about constraint programming Next edit →
Line 29: Finite ___domain solvers are useful for solving [[Constraint satisfaction problem\|Constraint satisfaction problems]], and are often based on Arc-Consistency (see [[AC-3 algorithm]]), or one of its approximations. ==References== [http://pubsonline.informs.org/feature/pdfs/0092.2102.01.3106.29.pdf Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming] [[Category:Programming paradigms]]

Constraint programming: Difference between revisions