Fülöp János and Imreh Balázs and Friedler Ferenc: On the reformulation of some classes of PNS-problems as set covering problems. In: Acta cybernetica, (13) 3. pp. 329-337. (1998)
Preview |
Cikk, tanulmány, mű
cybernetica_013_numb_003_329-337.pdf Download (867kB) | Preview |
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 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.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 1998 |
| Volume: | 13 |
| Number: | 3 |
| ISSN: | 0324-721X |
| Page Range: | pp. 329-337 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/38505/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: p. 336-337. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:26 |
| Last Modified: | 2022. Jun. 13. 15:43 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12594 |
Actions (login required)
 |
View Item |
