scientific article; zbMATH DE number 5139165
From MaRDI portal
Publication:3429158
Recommendations
- Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers
- scientific article; zbMATH DE number 5139167
- scientific article; zbMATH DE number 1903342
- scientific article; zbMATH DE number 2090309
- The basic algorithm for pseudo-Boolean programming revisited
- Solution and Optimization of Systems of Pseudo-Boolean Constraints
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- Contributions to the theory of practical quantified Boolean formula solving
- Abstract solvers for quantified Boolean formulas and their applications
- In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving
Cited in
(17)- Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers
- On dedicated CDCL strategies for PB solvers
- Efficient local search for pseudo Boolean optimization
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- Side-channel cryptographic attacks using pseudo-Boolean optimization
- Controlling a solver execution with the runsolver Tool
- Optimal base encodings for pseudo-Boolean constraints
- scientific article; zbMATH DE number 5139167 (Why is no real title available?)
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- The first and second Max-SAT evaluations
- Stabbing planes
- Rewriting optimization statements in answer-set programs
- Recent Findings in Boolean Techniques
- A proof system for graph (non)-isomorphism verification
- Promoting robust black-box solvers through competitions
- Engineering and evaluating multi-objective pseudo-Boolean optimizers
- SCIP: solving constraint integer programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3429158)
