Exploiting subproblem dominance in constraint programming (Q453591): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q264991
Set OpenAlex properties.
(4 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MiniZinc / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CHIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gecode / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10601-011-9112-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095067556 / rank
 
Normal rank

Revision as of 23:15, 19 March 2024

scientific article
Language Label Description Also known as
English
Exploiting subproblem dominance in constraint programming
scientific article

    Statements

    Exploiting subproblem dominance in constraint programming (English)
    0 references
    0 references
    0 references
    0 references
    27 September 2012
    0 references
    0 references
    caching
    0 references
    dominance
    0 references
    search
    0 references
    0 references
    0 references
    0 references
    0 references