### Abstract

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 are NP-hard. They 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.

Original language | English |
---|---|

Pages (from-to) | 329-337 |

Number of pages | 9 |

Journal | Acta Cybernetica |

Volume | 13 |

Issue number | 3 |

Publication status | Published - 1998 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture
- Software

### Cite this

*Acta Cybernetica*,

*13*(3), 329-337.

**On the reformulation of some classes of PNS-problems as set covering problems.** / Fülöp, J.; Imreh, B.; Friedler, F.

Research output: Contribution to journal › Article

*Acta Cybernetica*, vol. 13, no. 3, pp. 329-337.

}

TY - JOUR

T1 - On the reformulation of some classes of PNS-problems as set covering problems

AU - Fülöp, J.

AU - Imreh, B.

AU - Friedler, F.

PY - 1998

Y1 - 1998

N2 - 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 are NP-hard. They 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.

AB - 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 are NP-hard. They 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.

UR - http://www.scopus.com/inward/record.url?scp=0242479564&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0242479564&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0242479564

VL - 13

SP - 329

EP - 337

JO - Acta Cybernetica

JF - Acta Cybernetica

SN - 0324-721X

IS - 3

ER -