A non-binary constraint ordering heuristic for constraint satisfaction problems (Q2425983): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On forward checking for non-binary constraint satisfaction. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtrack programming techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-based heuristics for constraint-satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental evaluation of preprocessing algorithms for constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintenance scheduling problems as benchmarks for constraint algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3842642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3331003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed CSPs by graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4312457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5335732 / rank
 
Normal rank

Latest revision as of 20:48, 27 June 2024

scientific article
Language Label Description Also known as
English
A non-binary constraint ordering heuristic for constraint satisfaction problems
scientific article

    Statements

    A non-binary constraint ordering heuristic for constraint satisfaction problems (English)
    0 references
    0 references
    17 April 2008
    0 references
    heuristic search
    0 references
    constraint ordering
    0 references
    non-binary constraints
    0 references
    constrainedness
    0 references

    Identifiers