An efficient heuristic approach to solve the unate covering problem [logic minimisation]

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2000, Pages 364-371

  Cordone, Roberto ^a   Ferrandi, Fabrizio ^a   Sciuto, Donatella ^a   Calvo, Roberto Wolfler ^b  

^a POLITECNICO DI MILANO   (Italy)

^b JOINT RESEARCH CENTRE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BENCH-MARK PROBLEMS; BINARY DECISION DIAGRAMS (BDDS); BRANCH-AND-BOUND ALGORITHMS; CONSTRUCTIVE HEURISTIC ALGORITHM; COVERING PROBLEMS; HEURISTIC APPROACH; LAGRANGIAN RELAXATION; LOWER BOUNDS;

BINARY DECISION DIAGRAMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS;

EXHIBITIONS;

EID: 84893676115     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2000.840297     Document Type: Conference Paper

References (23)

1. E. Balas and A. Ho. Set Covering using cutting planes, heuristics and subgradient optimisation: A computational study. Mathematical Programming Study, 12:37-60, 1980.
2. J. E. Beasley. An algorithm for Set Covering problems. European Journal of Operational Research, 31:85-93, 1987.
3. R. K. Brayton, G. D. Hachtel, C. T. McMullen, and A. L. Sangiovanni-Vincentelli. Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers, Dordrecht, 1984.
4. R. K. Brayton, P. C. McGeer, J. Sanghavi, and A. L. Sangiovanni- Vincentelli. A new exact minimizer for two-level logic synthesis. In T. Sasao, editor, Logic Synthesis and Optimization, pages 1-31. Kluwer Academic Publishers, Dordrecht, 1993.
5. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-692, August 1986.
6. A. Caprara, M. Fischetti, and P. Toth. A heuristic algorithm for Set Covering problem. In Proceedings of the 5th Integer Programming and Combinatorial Optimization Conference (IPCO), 1996.
7. S. Ceria, P. Nobili, and A. Sassano. A lagrangian-based heuristic for large-scale Set Covering problems. Mathematical Programming, 81:215-228, 1998.
8. A. K. Chandra and G. Markowsky. On the number of prime implicants. Discrete Mathematics, 24:7-11, 1978.
9. V. Chvátal. A greedy heuristic for the Set Covering problem. Mathematics of Operations Research, 4(3):233-235, August 1979.
10. O. Coudert. Two-level logic minimization: An overview. INTEGRATION, the VLSI journal, 17:97-140, 1994.
11. O. Coudert. On solving covering problems. In Proceedings of the 33rd ACM/IEEE Design Automation Conference, pages 197-202, Las Vegas, NV, June 1996. ACM-SIGDA; IEEE, ACM Press.
12. O. Coudert, J. C. Madre, and H. Fraisse. A new viewpoint on twolevel logic minimization. In Proceedings of the 3oth ACM/IEEE Design Automation Conference, pages 625-630, Dallas, TX, June 1993.
13. M. L. Fisher and P. Kedia. Optimal solution of the Set Covering/Partitioning problem using dual heuristics. Management Science, 36:674-688, 1990.
14. E. I. Goldberg, L. P. Carloni, and A. L. Sangiovanni Vincentelli T. Villa, R. K. Brayton. Negative thinking by incremental problem solving: Application to unate covering. In Proceedings of the IEEE/ACM International Conference on CAD, Santa Clara, California, November 1997. ACM/IEEE, IEEE Computer Society Press.
15. S. Liao and S. Devadas. Solving covering problems using LPR-based lower bounds. In ACM-SIGDA; IEEE, editor, Proceedings of the 34th ACM/IEEE Design Automation Conference, Anaheim, CA, June 1997. ACM Press.
16. L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383-390, 1975.
17. E. L. McCluskey Jr. Minimization of boolean functions. Bell System Technical Journal, 35:1417-1444, April 1959.
18. S. -i. Minato. Zero-suppressed BDDs for set manipulation in combinatorial problems. In ACM-SIGDA; IEEE, editor, Proceedings of the 30th ACM/IEEE Design Automation Conference, pages 272-277, Dallas, TX, June 1993. ACM Press.
19. G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley and Sons, New York, 1988.
20. W. V. O. Quine. On cores and prime implicants of truth functions. American Mathematics Monthly, 66:755-760, 1959.
21. F. Somenzi. CUDD: Colorado University Decision Diagram Package. University of Colorado, Boulder, 1994.
22. G. M. Swamy, P. McGeer, and R. K. Brayton. A fully Quine-McCluskey procedure using BDD's. Report UCB/ERLM92/127, UCB, November 1992. Also in: Proceedings of the International Workshop on Logic Synthesis, Lake Tahoe, CA, May 1993.
23. T. Villa, T. Kam, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. Explicit and implicit algorithms for binate covering problems. IEEE Transactions on Computers, 16(7):677-691, July 1997.