| Autor: |
Csaba Holló, Balázs Imreh, Csanad Imreh |
| Zdroj: |
Optimization & Engineering; Sep2009, Vol. 10 Issue 3, p351-361, 11p |
| Abstrakt: |
Abstract Process Network Synthesis (PNS) has an enormous practical impact. The problem is very difficult to solve, determining the cost optimal network of operating units with fixed charge belongs to the complexity class of NP-hard problems. Therefore, it is important to develop reduction algorithms to minimize the size of the problem. In the present work the available reduction techniques for PNS problems are reviewed as well as a further reduction algorithm is presented. The performance of the new algorithm is examined by empirical analysis. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink