Solving Covering Problems Using LPR-based Lower Bounds
Authors:
- S. LiaoSLS. Liao
- S. DevadasSDS. Devadas
- 1 January 1997
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 117-120
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- On solving covering problems1996
- New Ideas for Solving Covering ProblemsProceedings of the 39th conference on Design automation - DAC '02, 1995
- Integer and Combinatorial Optimization1988
- An algorithm for set covering problemEuropean Journal of Operational Research, 1987
- A Reduction Technique for Prime Implicant TablesIEEE Transactions on Electronic Computers, 1965
- A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential NetworksIEEE Transactions on Electronic Computers, 1965
- On Cores and Prime Implicants of Truth FunctionsThe American Mathematical Monthly, 1959
- Minimization of Boolean Functions*Bell System Technical Journal, 1956
- A Way to Simplify Truth FunctionsThe American Mathematical Monthly, 1955