|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
LAWLER, E. L. Covering problems: l)uality relations and a new method of solution SIAM J. Appl. Math. 14 (1963), 1115-1132.
|
| |
2
|
BALINSKI, M.L. Integer programming: Methods, uses, and computation. Manage. Sci. 12 (1965), 253-313.
|
| |
3
|
KAUTZ, W.H. Fault testing and diagnosis in combinational digital circuits. IEEE Trans. C-17 (1968), 352-367.
|
| |
4
|
CEIR, INC. Integer linear programming system. Preliminary Users Guide, CEIR, Inc., 1180 Ave. of Americas, New York, 1965.
|
| |
5
|
COBHAM, A., FRIDSHAL, F., AND NORTH, J .H . An application of linear programming to the minimization of Boolean functions. Proc. Second Annual Symp. on Switching Circuit Theory and Logical Design, AIEE Pub. S134, Sept. 1961, pp. 3-9. Also, IBM Research Rep. RC-472, 1961.
|
| |
6
|
GEOFFRION, A.M. Integer programming by implicit enumeration and Bala's method. SIAM Rev. 9 (1967), 178-190.
|
| |
7
|
GEOFFRION, A. M. An improved implicit enumeration approach for integer programruing. Oper. Res. 17, 3 (May-June 1969), pp. 437-454.
|
| |
8
|
GIMPEL, J. F. A reduction technique for prime implicant tables. IEEE Trans. EC-14 (1965), 525-541.
|
| |
9
|
LuccIo, F. A method for the selection of prime implicants. IEEE Trans. EC-15 (1966), 205-212.
|
| |
10
|
COBHAM, A., FRIDSHAL, R. F., AND NORTH, J .H . A statistical study of the minimization of Boolean functions using integer programming. IBM Research Rep. RC-756, 1962.
|
| |
11
|
BnEUER, M.A. Combinatorial equivalence of (0, 1) circulant matrices. J. Comput. and Syst. Sci. 3 (1969), 8-23.
|
| |
12
|
The use of mathematical progrumming in the implementation of Boolean switching functions, Ph.D. Diss., U. of California, Berkeley, 1964.
|
| |
13
|
GORDON, B. B., Itous~;, R. W., LECHKElt, A. P., NELSON, L. 1)., AND RADO, T. Simplification of the covering problem for multiple output logical networks. IEEE Trans. EC-15 (1966), 891-897.
|
| |
14
|
LAWLER, E .L . Minimization of switching circuits subject to reliability conditions. IRE Trans. EC-IO (1962), 781-782.
|
| |
15
|
QUINE, W. V. On cores and prime implicants of truth functions. Amer. Math. Mon. 66 (1959), 755-760.
|
| |
16
|
FULKERSON, D. R. Blocking polyhedra. RANi) Memo l(M-5834-PR, RAND Corp., Santa Monica, Calif., 1968.
|
| |
17
|
PYNE, I. B., AND McCLusKEY, E .J . An essay on prime implicant tables. SIAM J. Appl. Math 9 (1961), 604-631.
|
| |
18
|
HAMMElt, P. L. Pseudo-Boolean programming and applications. Presented at Colloquium on Mathematics and Cybernetics in the Economy, Berlin, Oct. 1964 (Lecture Notes in Mathematics, Vol. 9).
|
| |
19
|
---- AND RUDEANU, S. Pseudo-Boolean methods for bivalent programining. Lecture at First European Meeting of the Institute of Management Sciences and of the Econometric Institute, Warsaw, Sept. 2-7, 1966 (Lecture Notes in Mathematics, Vol. 23).
|
| |
20
|
BALAS, E. Un algorithme additif pourla r6solution des programmes lindaires en variables bivalentes. Compt. Rend. Acad. SeN. Paris 258 (1964), 3817-3820.
|
| |
21
|
----. Extension de l'algorithme additif ~ la programmation en hombres entiers et ~ la programmation lin6aire. Compt. Rend. Acad. Sci. Paris 258 (1964), 5136 5139.
|
| |
22
|
----. An additive algorithm for solving linear programs with zero-one variables. Oper. Res. 13 (1965), 517-546.
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
G.1