Journal ArticleDOI
Computational complexity of heat exchanger network synthesis
Reads0
Chats0
TLDR
It is proved that HENS is N P -hard, thus refuting the possibility for the existence of a computationally efficient (polynomial) exact solution algorithm for this problem and facilitating the computational complexity analysis of more complex HENS problems and providing new insights to structural properties of the problem.About:
This article is published in Computers & Chemical Engineering.The article was published on 2001-09-15. It has received 133 citations till now. The article focuses on the topics: Computational problem & Function problem.read more
Citations
More filters
Journal ArticleDOI
A Critical Review and Annotated Bibliography for Heat Exchanger Network Synthesis in the 20th Century
TL;DR: A critical review of the literature on heat-exchanger network synthesis, the most commonly studied problem in process synthesis, and several classification schemes of this body of work based on a number of modeling and algorithmic criteria are presented.
Journal ArticleDOI
Solving heat exchanger network synthesis problems with Tabu Search
Bao Lin,David C. Miller +1 more
TL;DR: TS is shown to locate the global optima with a high probability and low computation times, demonstrating the algorithm’s potential for solving a variety of other mixed integer nonlinear programming (MINLP) problems.
Journal ArticleDOI
Optimal synthesis of heat exchanger networks involving isothermal process streams
TL;DR: A new MINLP model for heat exchanger network synthesis that includes streams with phase change is proposed, which provides the network structure that minimizes the total yearly cost.
Journal ArticleDOI
Heat exchanger network synthesis using a stagewise superstructure with non-isothermal mixing
TL;DR: A mixed-integer nonlinear programming formulation and a solution strategy to incorporate non-isothermal mixing in HENS using an existing modification of the stagewise superstructure is proposed and it is shown that including the stage bypass variables and constraints improves solution quality and efficiency.
Journal ArticleDOI
A novel approach for synthesis of cost-optimal heat exchanger networks
TL;DR: The results of this study show that the new approach to synthesis of cost-optimal heat exchanger networks is able to find more economical networks than those generated by other methods.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Network Flows: Theory, Algorithms, and Applications
TL;DR: In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.
Journal ArticleDOI
Combinatorial optimization: algorithms and complexity
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.