Exploiting subproblem dominance in constraint programming (Q453591)
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: Exploiting subproblem dominance in constraint programming |
scientific article; zbMATH DE number 6087656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploiting subproblem dominance in constraint programming |
scientific article; zbMATH DE number 6087656 |
Statements
Exploiting subproblem dominance in constraint programming (English)
0 references
27 September 2012
0 references
caching
0 references
dominance
0 references
search
0 references
0 references
0.8894608020782471
0 references
0.7629799246788025
0 references
0.7381965517997742
0 references
0.7299978733062744
0 references
0.7035484910011292
0 references
