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...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Fülöp János
Imreh Balázs
Friedler Ferenc
Dokumentumtípus: Cikk
Megjelent: 1998
Sorozat:Acta cybernetica 13 No. 3
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12594
LEADER 01428nab a2200241 i 4500
001 acta12594
005 20220613154304.0
008 161015s1998 hu o 0|| eng d
022 |a 0324-721X 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Fülöp János 
245 1 3 |a On the reformulation of some classes of PNS-problems as set covering problems  |h [elektronikus dokumentum] /  |c  Fülöp János 
260 |c 1998 
300 |a 329-337 
490 0 |a Acta cybernetica  |v 13 No. 3 
520 3 |a 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. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Számítástechnika, Kibernetika 
700 0 1 |a Imreh Balázs  |e aut 
700 0 1 |a Friedler Ferenc  |e aut 
856 4 0 |u http://acta.bibl.u-szeged.hu/12594/1/cybernetica_013_numb_003_329-337.pdf  |z Dokumentum-elérés