Topics in computer‐aided design: Part I. An optimum tearing algorithm for recycle systems
- 1 November 1973
- journal article
- research article
- Published by Wiley in AIChE Journal
- Vol. 19 (6), 1170-1181
- https://doi.org/10.1002/aic.690190614
Abstract
The concepts of ineligible streams and two‐way edge reduction are extended to simplify the signal flow diagram of a recycle process flow sheet graph. The solution to a tearing problem can be obtained readily by repeated reduction of ineligible streams and two‐way edges. When this fails, a branch and bound method will guarantee optimality at the expense of a few enumerations.This publication has 10 references indexed in Scilit:
- Decomposition of netsThe Chemical Engineering Journal, 1972
- An efficient algorithm for optimum decomposition of recycle systemsAIChE Journal, 1972
- A New Search Algorithm for Finding the Simple Cycles of a Finite Directed GraphJournal of the ACM, 1972
- The structuring of process optimizationAIChE Journal, 1970
- Branch-and-Bound Methods: General Formulation and PropertiesOperations Research, 1970
- Decomposition Procedures for the Solving of Large Scale SystemsPublished by Elsevier ,1970
- Computer Solutions to Minimum-Cover ProblemsOperations Research, 1969
- Structuring design computationsAIChE Journal, 1969
- On the ordering of recycle calculationsAIChE Journal, 1966
- A matrix method for location of cycles of a directed graphAIChE Journal, 1965