Improving Unsatisfiability-Based Algorithms for Boolean Optimization

DOI10.1007/978-3-642-14186-7_16zbMath1306.68166OpenAlexW1502387139MaRDI QIDQ4930588

Ruben Martins, Inês Lynce, Vasco M. Manquinho

Publication date: 29 September 2010

Published in: Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14186-7_16

Mathematics Subject Classification ID

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

Related Items (3)

An overview of parallel SAT solving ⋮ Exploiting subproblem optimization in SAT-based maxsat algorithms ⋮ Iterative and core-guided maxsat solving: a survey and assessment

Uses Software

• PicoSAT
• Unnamed Item

This page was built for publication: Improving Unsatisfiability-Based Algorithms for Boolean Optimization