This paper is primarily concerned with finding a minimum dominant set in a directed graph with multiple variable streams. The presented algorithm, which is ased on a relationship between the graph on study and a system of formal equations, enables to produce a minimum set of tearing variables without applying phases characterized by iterative decisions. Thus, as neither logical nor practical difficulties are met, the algorithm can be easily implemented in a digital program.
Referenze Bibliografiche
[1]
D. M. HIMMELBLAU e
K. B. BISCHOFF,
Process Analysis and Simulation,
Wiley, New York
1967. |
Zbl 0162.50601[2] E. S. HENLEY e E. M. ROSEN, Material and Energy Balance Computations, Prantice Hall, Englewood Cliffs, New York 1971.
[3] A. K. KEVORKIAN e J. SNOEK, Lavoro presentato al Convegno: «Decomposition as a tool for solving large-scale problems», Cambridge (GB), luglio 17-26 (1972).
[4] A. LEMPBEL e I. CEDERBAUM, «IEE Trans. on Circuit Theory», CT-10, 399 (1966).
[5]
I. B. PYNE e
J. E. MCCLUSKEY, «
IRE Trans. on Electronic Computers», EC-
11, 473 (
1962). |
MR 170501[6]
F. LUCCIO, «
IRE Trans. on Electronic Computers», EC-
15, 205 (
1966). |
MR 204214[7] W. H. SARGENT e A. W. WESTERBERG, «Trans. Inst. Chem. Engrs.» 42, 190 (1964).
[8] W. LEE e D. F. RUDD, «A.I. Ch. E.J.», 15, 1184, (1966).
[9] J. H. CHRISTENSEN e D. F. RUDD, «A.I. Ch. E. J.», 15, 94 (1969).
[10] D. V. STEWARD e J. SIAM, «Ser. B.», 2, 345 (1965).
[11] G. J. FORDER e H. P. HUTCHINSON, «Chem. Eng. Science», 24, 771 (1969).
[12] R. S. UPADHYE e E. A. GRENS II, «A. I. Ch. E. J.», 18, 533 (1972).
[13] G. BIARDI, S. PIERUCCI, R. RUGGIERI e M. DENTE, «Ing. Chim. Ital.», 9, 5 (1973).
[14] R. W. BARKLEY e R. L. MOTARD, Lavoro presentato al Convegno: «Decomposition as a tool for solving large-scale problems», Cambridge (GB), luglio 17-26 (1972).
[15] S. PIERUCCI, E. RANZI, G. BIARDI e M. DENTE, «Ing. Chim. Ital.», 9, 73 (1973).
Con il contributo del Ministero per i Beni e le Attività Culturali