Achieving Domain Consistency and Counting Solutions for Dispersion Constraints (Q2802248): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A \texttt{cost-regular} based hybrid column generation approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4656770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SPREAD: A Balancing Constraint Based on Statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bound-consistent spread constraint. Application to load balancing in nurse-to-patient assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Deviation Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming approach for consistency and propagation for knapsack constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution counting algorithms for constraint-centered search heuristics / rank
 
Normal rank

Revision as of 20:22, 11 July 2024

scientific article
Language Label Description Also known as
English
Achieving Domain Consistency and Counting Solutions for Dispersion Constraints
scientific article

    Statements

    Achieving Domain Consistency and Counting Solutions for Dispersion Constraints (English)
    0 references
    0 references
    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

    Identifiers