A note on connection between PNS and set covering problems

Process network synthesis (PNS) has enormous practical impact; however, its mixed integer programming model is tedious to solve because it usually involves a large number of binary variables. Using a combinatorial approach, a structural model of PNS can be given, and a branch-and-bound technique can...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Blázsik Zoltán
Imreh Balázs
Dokumentumtípus: Cikk
Megjelent: 1996
Sorozat:Acta cybernetica 12 No. 3
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12563
LEADER 01463nab a2200229 i 4500
001 acta12563
005 20220613135604.0
008 161015s1996 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 Blázsik Zoltán 
245 1 2 |a A note on connection between PNS and set covering problems  |h [elektronikus dokumentum] /  |c  Blázsik Zoltán 
260 |c 1996 
300 |a 309-312 
490 0 |a Acta cybernetica  |v 12 No. 3 
520 3 |a Process network synthesis (PNS) has enormous practical impact; however, its mixed integer programming model is tedious to solve because it usually involves a large number of binary variables. Using a combinatorial approach, a structural model of PNS can be given, and a branch-and-bound technique can be applied for searching an optimal solution. In some realistic examples of PNS, this method is efficient. Nevertheless, efficient methods are unavailable for solving these models generally. In this note, we describe a special class of PNS-problems as set-covering or set-partitioning problems. These problems are well-known to be NP-complete, thus, a PNS-problem is NP-hard. 
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 
856 4 0 |u http://acta.bibl.u-szeged.hu/12563/1/cybernetica_012_numb_003_309-312.pdf  |z Dokumentum-elérés