.png){kind=icon}
返回
Approximation algorithms for process systems engineering
.png){kind=icon}
OA
AI
DOI：10.1016/j.compchemeng.2019.106599.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Designing and analyzing algorithms with provable performance guarantees enables efficient optimization problem solving in different application domains, e.g. communication networks, transportation, economics, and manufacturing. Despite the significant contributions of approximation algorithms in engineering, only limited and isolated works contribute from this perspective in process systems engineering. The current paper discusses three representative, NP-hard problems in process systems engineering: (i) pooling, (ii) process scheduling, and (iii) heat exchanger network synthesis. We survey relevant results and raise major open questions. Further, we present approximation algorithms applications which are relevant to process systems engineering: (i) better mathematical modeling, (ii) problem classification, (iii) designing solution methods, and (iv) dealing with uncertainty. This paper aims to motivate further research at the intersection of approximation algorithms and process systems engineering. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Approximation algorithms
Heuristics with performance guarantees
Theoretical computer science
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
Phenolic Compounds and Antioxidant Property of Petal Extracts of Six Lilium Species Native to ChinaOAAI
OAAI分享收藏分享收藏
分享收藏
查看更多内容