Introduction to Constraint Programming
summary
Introduces constraint programming (CP) with concrete examples and tools: models that enumerate 84 integer right triangles under perimeter 200 (42 up to symmetry) and then maximize area, a Sudoku solver that solves a diabolical puzzle in about 12 ms using pure constraints, and an industrial case modeling Lectra fabric cutting and VM scheduling across tens of CPUs with timing/resource constraints. Tools mentioned are OscaR, OptaPlanner, and Choco.
AI-written summary · about
chapters (8)
- 0:00Constraint programming intro
- 1:46Variables and constraints
- 4:35Constraint satisfaction problems
- 9:31Concrete modeling examples
- 19:20Textile industry case
- 24:10How constraint solvers work
- 35:12When to use CP
- 38:57Q&A
related talks
01h 24mIntroduction to Constraint Logic Programming
45mProblem Solved! Using Logic Programming to Find Answers
49mAutomating Index Selection Using Constraint Programming
20mPolygon: Symbolic Reasoning for SQL using Conflict-Driven Under-Approximation Search
34mConstraint Logic Propagation Conflict Spreadsheets
57mQuery Optimization and Evaluation 1: Output Size Bounds and Information Theory
24mExact Covering with Colours
18mMaximum Consensus Floating Point Solutions for Infeasible Low-Dimensional Linear(…)