The following pages link to (Q3429162):
Displaying 14 items.
- Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers (Q421579) (← links)
- Cardinality networks: a theoretical and empirical study (Q538318) (← links)
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models (Q785238) (← links)
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← links)
- Encoding cardinality constraints using multiway merge selection networks (Q2009191) (← links)
- Improving the Normalization of Weight Rules in Answer Set Programs (Q2938492) (← links)
- Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem (Q2938540) (← links)
- Optimal Base Encodings for Pseudo-Boolean Constraints (Q3000648) (← links)
- BDDs for Pseudo-Boolean Constraints – Revisited (Q3007674) (← links)
- Towards Robust CNF Encodings of Cardinality Constraints (Q3523075) (← links)
- New Encodings of Pseudo-Boolean Constraints into CNF (Q3637167) (← links)
- Algorithms for Weighted Boolean Optimization (Q3637182) (← links)
- Exact and approximate determination of the Pareto front using minimal correction subsets (Q6164362) (← links)
