Pages that link to "Item:Q3524260"
From MaRDI portal
The following pages link to Compiling Finite Linear CSP into SAT (Q3524260):
Displaying 8 items.
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction (Q352963) (← links)
- Promoting robust black-box solvers through competitions (Q606901) (← links)
- Compiling finite linear CSP into SAT (Q842794) (← links)
- Propagation via lazy clause generation (Q2272160) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- An Optimal Constraint Programming Approach to the Open-Shop Problem (Q2815442) (← links)
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
- Propagation = Lazy Clause Generation (Q3523077) (← links)
