Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 1970-1974  (2)
  • 1973  (2)
Source
Material
Years
  • 1970-1974  (2)
Year
Keywords
  • 1
    Electronic Resource
    Electronic Resource
    Topics in computer-aided design: Part I. An optimum tearing algorithm for recycle systems (1973)
    Hoboken, NJ : Wiley-Blackwell
    AIChE Journal 19 (1973), S. 1170-1181 
    Details
    ISSN: 0001-1541
    Keywords: Chemistry ; Chemical Engineering
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: 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.
    Additional Material: 14 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/aic.690190614
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Topics in computer-aided design: Part II. Synthesis of optimal heat exchanger networks by tree searching algorithms (1973)
    Hoboken, NJ : Wiley-Blackwell
    AIChE Journal 19 (1973), S. 1182-1189 
    Details
    ISSN: 0001-1541
    Keywords: Chemistry ; Chemical Engineering
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: A compact matrix representation of an acyclic exchanger network is derived and used to generate a decision tree for the heat exchanger problem. The optimal network, which is imbedded in one of the tree nodes, is located by enumerating the entire tree using a search procedure. When this is not feasible, an alternate partial enumeration method is suggested. Sample problems ranging in size from 4 to 10 streams are used to illustrate the methods.
    Additional Material: 7 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/aic.690190615
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...