An efficient bounds consistency algorithm for the global cardinality constraint (Q816677): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / 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: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction using constraint logic programming / rank
 
Normal rank

Latest revision as of 10:40, 24 June 2024

scientific article
Language Label Description Also known as
English
An efficient bounds consistency algorithm for the global cardinality constraint
scientific article

    Statements

    An efficient bounds consistency algorithm for the global cardinality constraint (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 February 2006
    0 references
    global constraints
    0 references
    bounds consistency
    0 references
    domain consistency
    0 references

    Identifiers