On the reformulation of some classes of PNS-problems as set covering problems
Process network synthesis (PNS) has enormous practical impact; however, its solution is difficult in general. This experience has been recently reasoned by Blázsik and Imreh who pointed out that PNS-problems axe NP-hard. The y proved that a simple subclass of PNS-problems is equivalent to the class...
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
1998
|
| Series: | Acta cybernetica
13 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12594 |
| Summary: | Process network synthesis (PNS) has enormous practical impact; however, its solution is difficult in general. This experience has been recently reasoned by Blázsik and Imreh who pointed out that PNS-problems axe NP-hard. The y proved that a simple subclass of PNS-problems is equivalent to the class of set covering problems. In the present paper, it is shown that more general classes of PNS-problems can also be reformulated as set covering problems. This enables the sophisticated techniques developed for solving set covering problems also to be applied for solving some PNS-problems. |
|---|---|
| Physical Description: | 329-337 |
| ISSN: | 0324-721X |