New filtering algorithms for combinations of among constraints (Q842795): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Principles of Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introducing global constraints in CHIP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \texttt{cost-regular} based hybrid column generation approach / 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: Combination of Among and Cardinality Constraints / 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: Revisiting the Sequence Constraint / rank
 
Normal rank

Latest revision as of 00:30, 2 July 2024

scientific article
Language Label Description Also known as
English
New filtering algorithms for combinations of among constraints
scientific article

    Statements

    New filtering algorithms for combinations of among constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 September 2009
    0 references
    sequence constraint
    0 references
    domain consistency
    0 references
    polynomial time filtering
    0 references
    car sequencing
    0 references
    regular constraint
    0 references

    Identifiers