definition · term 5 of 25
constraint programming (CP).
A way to solve combinatorial problems by stating variables, their possible values and the rules that must hold together.
worked exampleshifts that must fit togetherEach nurse is a variable with the values early, late or off. Rules say no late followed by early, and two qualified people on every shift. The solver keeps only the values that can still fit.
in plain language
Constraint programming is strong on feasibility and on scheduling with many logical rules. Where LP and MIP work with linear equations, CP narrows down the possible values of each variable through propagation and then searches. It handles sequencing, "if this then that" rules and irregular domains well.
constraint programming, on your own decision.
Bring one recurring decision. Your planners see the terms of this glossary applied to their own rules and data.
- Glossary
- all 25 terms, a to z
- Problem types
- the decisions kint solves
- Comparisons
- kint next to other approaches
- Contact
- hello@kint.pro