The following pages link to (Q3429158):
Displaying 15 items.
- Promoting robust black-box solvers through competitions (Q606901) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers (Q1656563) (← links)
- On dedicated CDCL strategies for PB solvers (Q2118312) (← links)
- Efficient local search for pseudo Boolean optimization (Q2118314) (← links)
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques (Q2385178) (← links)
- Side-channel cryptographic attacks using pseudo-Boolean optimization (Q2398519) (← links)
- Controlling a solver execution with the runsolver Tool (Q2786915) (← links)
- Optimal Base Encodings for Pseudo-Boolean Constraints (Q3000648) (← links)
- (Q3429161) (← links)
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms (Q3502710) (← links)
- Stabbing planes (Q4993273) (← links)
- Rewriting optimization statements in answer-set programs (Q5240209) (← links)
- Recent Findings in Boolean Techniques (Q5856082) (← links)
- A proof system for graph (non)-isomorphism verification (Q5883756) (← links)
