Research map / Learning theory and algorithms / Combinatorial and search optimization
Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Add hybrid core-guided and linear search | ROUNDINGSAT · PB16 | instances solved to optimality: 853 -> 968 | Helped |
| Add hybrid core-guided and linear search | ROUNDINGSAT · CRAFT | instances solved to optimality: 309 -> 639 | Helped |
| Add hybrid core-guided and linear search | ROUNDINGSAT · KNAP | instances solved to optimality: 341 -> 306 | Hurt |
| Add non-clausal cardinality cores rather than clausal cores (ablation) | HYBRID · PB16 | instances solved to optimality: 937 -> 968 | Helped |
| Add non-clausal cardinality cores rather than clausal cores (ablation) | HYBRID · CRAFT | instances solved to optimality: 618 -> 639 | Helped |
| Use lazy rather than eager objective reformulation (ablation) | HYBRID · KNAP | instances solved to optimality: 186 -> 306 | Helped |
| Use lazy rather than eager objective reformulation (ablation) | HYBRID · MIP | instances solved to optimality: 70 -> 78 | Helped |
| Combine core-guided search with repeated linear-search phases (ablation) | ROUNDINGSAT · KNAP | instances solved to optimality: 341 -> 306 | Hurt |
| Use independent-core extraction (ablation) | HYBRID with stratification · CRAFT | instances solved to optimality | Hurt |
| Use independent-core extraction (ablation) | HYBRID with stratification · MIP and KNAP | instances solved to optimality | Helped |
| Set the phase to the incumbent solution during linear search (ablation) | HYBRID · PB optimization benchmarks | solver performance | No clear effect |
Closest papers by meaning
- SAT-Based Tree Decomposition with Iterative Cascading Policy Selection (AAAI 2024 · similarity 0.87)
- Unifying Decision and Function Queries in Stochastic Boolean Satisfiability (AAAI 2024 · similarity 0.86)
- The Impact of Literal Sorting on Cardinality Constraint Encodings (AAAI 2025 · similarity 0.85)
- CEGAR-Based Approach for Solving Combinatorial Optimization Modulo Quantified Linear Arithmetics Problems (AAAI 2024 · similarity 0.85)
- Learning How to Cube (NeurIPS 2026 · similarity 0.85)
- DiverSAT: A Novel and Effective Local Search Algorithm for Diverse SAT Problem (AAAI 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.