Solving covering problems using LPR-based lower bounds

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Volumn 8, Issue 1, 2000, Pages 9-17

  Fallah, Farzan ^a,b   Liao, Stan ^a,c   Devadas, Srinivas ^a,d  

^a IEEE

^b FUJITSU LABORATORIES OF AMERICA   (United States)

^c SYNOPSYS INC   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING;

COVERING PROBLEMS; LINEAR PROGRAMMING RELAXATION (LPR);

LOGIC DESIGN;

EID: 0034135579     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/92.820757     Document Type: Article

References (15)

1. P. Barth, "A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization," Max-Planck-Institut für Informatik, Saarbrücken, Germany, Tech. Rep. MPI-I-95-2-003, Jan. 1995.
2. J. E. Beasley, "An algorithm for set covering problem," Eur. J. Oper. Res., vol. 31, pp. 85-93, 1987.
3. O. Coudert, "On solving binate covering problems," in Proc. ACM/IEEE Design Automation Conf., June 1996, pp. 197-202.
4. O. Coudert and J.-C. Madre, "New ideas for solving covering problems," in Proc. ACM/IEEE Design Automation Conf., June 1995, pp. 641-646.
5. S. Devadas and A. R. Newton, "Exact algorithms for output encoding, state assignment and four-level Boolean minimization," IEEE Trans. Computer-Aided Design, pp. 13-27, Jan. 1991.
6. J.F. Gimpel, "The minimization of TANT networks," IEEE Trans. Electron. Comput., vol. EC-16, pp. 18-38, Feb. 1967.
7. _, "A reduction technique for prime implicant tables," IEEE Trans. Electron. Comput., vol. 14, pp. 535-541, June 1965.
8. E. Goldberg, L. Carloni, T. Villa, R. K. Brayton, and A. Sangiovanni-Vincentelli, "Negative thinking in search methods: Application to unate covering," presented at the Int. Workshop Logic Synthesis, May 1997.
9. A. Grasselli and F. Luccio, "A method for minimizing the number of internal states in incompletely specified machines," IEEE Trans. Electron. Comput., vol. EC-14, pp. 350-359, June 1965.
10. S. Y. Liao, S. Devadas, K. Keutzer, and S. Tjiang, "Instruction selection using binate covering for code size minimization," in Proc. Int. Conf. Computer-Aided Design, Nov. 1996, pp. 393-399.
11. E. L. McCluskey Jr., "Minimization of Boolean functions," Bell Syst. Tech. J., vol. 35, pp. 1417-1444, Apr. 1959.
12. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, New York: Wiley, 1988.
13. W. V. O. Quine, "A way to simplify truth functions," Amer. Math. Monthly, vol. 62, pp. 627-631, 1955.
14. _, "On cores and prime implicants of truth functions," Amer. Math. Monthly, vol. 66, pp. 755-760, 1959.
15. R. L. Rudell, "Logic synthesis for VLSI design," Ph.D. dissertation, Dept. Elect. Eng. Comput. Sci., Univ. California at Berkeley, Berkeley, CA, 1989.