This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
M. E. Shtein and B. E. Shtein, Methods of Machine Design of Digital Equipment [in Russian], Sovet-skoe Radio, Moscow (1973).
A. N. Melikhov, L. S. Bershtein, and V. M. Kureichik, Application of Graphs to Discrete Device Design [in Russian], Nauka, Moscow (1974).
A. I. Petrenko and A. Ya. Tetel'baum, “Reduction of design problems to 0–1 programming,” Kibernetika, No. 3, 64–99 (1976).
T. Tbaraki, “Integer programming formulation of combinatorial optimization problems,” Discrete Math. No. 16, 39–52 (1976).
F. Glover and E. Woolsey, “Converting the 0–1 polynomial programming problem to 0–1 linear program,” Oper. Res., No. 22, 180–182 (1974).
P. L. Hammer and S. Rudeanum, Boolean Methods in Operations Research and Related Areas, Springer-Verlag, Berlin (1968).
L. J. Watter, “Reduction of integer polynomial programming problems to zero-one linear programming problems,” Oper. Res., No. 15, 1171–1174 (1967).
T. Saaty, Optimization in Integers and Related Extremal Problems, McGraw-Hill, New York (1970).
V. G. Abakumov and B. L. Shramchenko, “One approach to the solution of the location problem,” in: Design Automation in Electronics [in Russian], No. 10, Kiev (1974), pp. 120–123.
A. Ya. Tetel'baum, “A sequential-parallel location algorithm for electronic components,” Upravl. Sist. Mash., No. 2, 118–122 (1977).
Translated from Kibernetika, No. 3, pp. 49–55, March–April, 1981.
About this article
Cite this article
Petrenko, A.I., Tetel'baum, A.Y. & Shramchenko, B.L. Algebraic formulation of circuit design problems. Cybern Syst Anal 17, 210–219 (1981). https://doi.org/10.1007/BF01069635
- Operating System
- Artificial Intelligence
- System Theory
- Design Problem
- Circuit Design