Achieving domain consistency and counting solutions for dispersion constraints (Q2802248)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Achieving domain consistency and counting solutions for dispersion constraints |
scientific article; zbMATH DE number 6573372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Achieving domain consistency and counting solutions for dispersion constraints |
scientific article; zbMATH DE number 6573372 |
Statements
25 April 2016
0 references
combinatorial optimization
0 references
constraint programming
0 references
balance
0 references
spread constraint
0 references
deviation constraint
0 references
filtering algorithms
0 references
branching heuristics
0 references
counting-based search
0 references
0 references
0 references
Achieving domain consistency and counting solutions for dispersion constraints (English)
0 references
0.8176639676094055
0 references
0.7574816942214966
0 references
0.7364983558654785
0 references
0.736498236656189
0 references
0.728075385093689
0 references
