Negative thinking in branch-and-bound: the case of unate covering
- 1 March 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 19 (3) , 281-294
- https://doi.org/10.1109/43.833198
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Solving Covering Problems Using LPR-based Lower BoundsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- Negative thinking by incremental problem solving: application to unate coveringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- On solving covering problemsPublished by Association for Computing Machinery (ACM) ,1996
- New Ideas for Solving Covering ProblemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1995
- Two-level logic minimization: an overviewIntegration, 1994
- Multiple-Valued Minimization for PLA OptimizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987