A framework for certified Boolean branch-and-bound optimization
From MaRDI portal
Publication:2429985
DOI10.1007/s10817-010-9176-zzbMath1213.68581MaRDI QIDQ2429985
Albert Oliveras, Enric Rodríguez-Carbonell, Robert Nieuwenhuis, Javier Larrosa
Publication date: 5 April 2011
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-010-9176-z
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Curriculum-based course timetabling with SAT and MaxSAT, Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Pseudo-Boolean optimization
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Radio link frequency assignment
- Satisfiability-based algorithms for Boolean optimization
- A logical approach to efficient Max-SAT solving
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Rocket-Fast Proof Checking for SMT Solvers
- Efficient Generation of Unsatisfiability Proofs and Cores in SAT
- On SAT Modulo Theories and Optimization Problems
