On using cutting planes in pseudo-Boolean optimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5139167
- Theory and Applications of Satisfiability Testing
- Terse integer linear programs for Boolean optimization
- In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving
- Search techniques for SAT-based Boolean optimization
Cited in
(10)- Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers
- In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Using \(\mathrm{DRL}^*\) relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut
- Terse integer linear programs for Boolean optimization
- scientific article; zbMATH DE number 1538005 (Why is no real title available?)
- scientific article; zbMATH DE number 7455719 (Why is no real title available?)
- Theory and Applications of Satisfiability Testing
- MaxSAT-based cutting planes for learning graphical models
- Solving satisfiability problems with preferences
This page was built for publication: On using cutting planes in pseudo-Boolean optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3429164)
