Pages that link to "Item:Q3523075"
From MaRDI portal
The following pages link to Towards Robust CNF Encodings of Cardinality Constraints (Q3523075):
Displaying 11 items.
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
- Cardinality networks: a theoretical and empirical study (Q538318) (← links)
- Automatically improving constraint models in Savile Row (Q1680696) (← links)
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718) (← links)
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← links)
- Multi-agent path finding with mutex propagation (Q2082515) (← links)
- A Boolean satisfiability approach to the resource-constrained project scheduling problem (Q2430594) (← links)
- Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem (Q2938540) (← links)
- Cardinality Networks and Their Applications (Q3637166) (← links)
- A lower bound on CNF encodings of the at-most-one constraint (Q5915765) (← links)
- CNF encodings of symmetric functions (Q6635697) (← links)
