Pages that link to "Item:Q5897193"
From MaRDI portal
The following pages link to Principles and Practice of Constraint Programming – CP 2003 (Q5897193):
Displayed 11 items.
- Curriculum-based course timetabling with SAT and MaxSAT (Q475170) (← links)
- Cardinality networks: a theoretical and empirical study (Q538318) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- An efficient approach to solving random \(k\)-SAT problems (Q877837) (← links)
- Some computational aspects of DISTANCE SAT (Q877840) (← links)
- Propagation via lazy clause generation (Q2272160) (← links)
- A Boolean satisfiability approach to the resource-constrained project scheduling problem (Q2430594) (← links)
- GAC Via Unit Propagation (Q3523055) (← links)
- Towards Robust CNF Encodings of Cardinality Constraints (Q3523075) (← links)
- Cardinality Networks and Their Applications (Q3637166) (← links)
- New Encodings of Pseudo-Boolean Constraints into CNF (Q3637167) (← links)