Category:Constraint programming
![]() | Computing portal |
Here is a list of articles in the Constraint programming category of the Computing portal that unifies foundations of mathematics and computations using computers.
![]() |
Wikimedia Commons has media related to Constraint programming. |
Subcategories
This category has only the following subcategory.
C
Pages in category "Constraint programming"
The following 62 pages are in this category, out of 62 total.
- Constraint programming (computing)
*
- Constraint satisfaction (computing)
- Symmetry-breaking constraints (computing)
A
- AC-3 algorithm (computing)
- Allen's interval algebra (computing)
B
- Backjumping (computing)
- Backmarking (computing)
- Barrier function (computing)
- Basis pursuit (computing)
- Bertrand (programming language) (computing)
- Binary constraint (computing)
- BNR Prolog (computing)
C
- Cassowary (software)
- Chaff algorithm (computing)
- CLP(R) (computing)
- Complexity of constraint satisfaction (computing)
- Consensus dynamics (computing)
- Constrained optimization (computing)
- Constraint (mathematics) (computing)
- Constraint composite graph (computing)
- Constraint Composite Graph (computing)
- Constraint graph (computing)
- Constraint inference (computing)
- Constraint learning (computing)
- Constraint logic programming (computing)
- Constraint satisfaction dual problem (computing)
- Constraint satisfaction problem (computing)
D
- Davis–Putnam algorithm (computing)
- Decomposition method (constraint satisfaction) (computing)
- Difference-map algorithm (computing)
- Distributed constraint optimization (computing)
- DPLL algorithm (computing)
- DPLL(T) (computing)
G
- Gecode (computing)
- Geometric constraint solving (computing)
- GNU Prolog (software)
H
- Hidden transformation (computing)
- Hierarchical constraint satisfaction (computing)
- Hybrid algorithm (constraint satisfaction) (computing)
I
- ILOG (computing)
- Interchangeability algorithm (computing)
- Intertemporal budget constraint (computing)
J
- JaCoP (solver) (computing)
K
- Kaleidoscope (programming language) (computing)
L
- Local consistency (computing)
- Local search (constraint satisfaction) (computing)
- Look-ahead (backtracking) (computing)
M
- Min-conflicts algorithm (computing)
- Minion (solver) (computing)
N
- Narrowing of algebraic value sets (computing)
- Nurse scheduling problem (computing)
O
- Ordered graph (computing)
R
- Reasoning system (computing)
- Region connection calculus (computing)
- Regular constraint (computing)
S
- Satisfiability modulo theories (computing)
- Schaefer's dichotomy theorem (computing)
- SWI-Prolog (software)
T
- Test functions for optimization (computing)
- Traveling tournament problem (computing)
W
- WalkSAT (computing)
- Weighted constraint satisfaction problem (computing)