Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates

DOI10.1007/978-3-642-02777-2_42zbMath1247.68255OpenAlexW1503979545MaRDI QIDQ3637179

Albert Oliveras, Javier Larrosa, Enric Rodríguez-Carbonell, Robert Nieuwenhuis

Publication date: 7 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02777-2_42

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

A framework for certified Boolean branch-and-bound optimization ⋮ Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One

Uses Software

• MaxSolver
• SATLIB
• GLPK

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Solving SAT and SAT Modulo Theories
• A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories
• Efficient Generation of Unsatisfiability Proofs and Cores in SAT
• On SAT Modulo Theories and Optimization Problems

This page was built for publication: Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates