# State-of-the-art Methods for Pseudo-Boolean Solving with SCIP

arXiv: https://arxiv.org/abs/2501.03390 · HTML: https://mlsanity.com/paper/2501.03390/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 Jan 2025.

## Built on by (most cited first, 1 of 1)

- [Orbitopal Fixing in SAT](https://mlsanity.com/paper/2601.16855/) (2026)

## Abstract (arXiv)

The Pseudo-Boolean problem deals with linear or polynomial constraints with integer coefficients over Boolean variables. The objective lies in optimizing a linear objective function, or finding a feasible solution, or finding a solution that satisfies as many constraints as possible. In the 2024 Pseudo-Boolean competition, solvers incorporating the SCIP framework won five out of six categories it was competing in. From a total of 1,207 instances, SCIP successfully solved 759, while its parallel version FiberSCIP solved 776. Based on the results from the competition, we further enhanced SCIP's Pseudo-Boolean capabilities. This article discusses the results and presents the winning algorithmic ideas.