Compiling finite linear CSP into SAT (Q842794): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch \(\&\) bound algorithm for the open-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3489523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the open-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive and cooperative approach to propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search with constraint propagation and conflict-based heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compiling Finite Linear CSP into SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473043 / rank
 
Normal rank

Revision as of 23:30, 1 July 2024

scientific article
Language Label Description Also known as
English
Compiling finite linear CSP into SAT
scientific article

    Statements

    Compiling finite linear CSP into SAT (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 September 2009
    0 references
    constraint satisfaction problems
    0 references
    SAT encoding
    0 references
    open-shop scheduling problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers