Satisfiability-Based Algorithms for Boolean Optimization
- 1 March 2004
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 40 (3-4) , 353-372
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Computing prime implicants by integer programming2005
- GRASP-A new search algorithm for satisfiability2002
- An exact solution to the minimum size test pattern problem2002
- Explicit and implicit algorithms for binate covering problemsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1997
- Solving Covering Problems Using LPR-based Lower Bounds1997
- SATO: An efficient propositional prover1997
- Negative thinking by incremental problem solving: application to unate covering1997
- Using CSP look-back techniques to solve exceptionally hard SAT instances1996
- Integer and Combinatorial Optimization1988
- A Reduction Technique for Prime Implicant TablesIEEE Transactions on Electronic Computers, 1965