On decision-mappings related to process network synthesis problem
Process network synthesis (PNS) has enormous practical impact and a structural model can be given for it on the basis of a combinatorial approach. An important tool of this approach is the notion of the decision-mapping. In the present work, the number of the consistent decision-mappings is counted...
Elmentve itt :
| Szerzők: | |
|---|---|
| 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/12593 |
| LEADER | 01218nab a2200241 i 4500 | ||
|---|---|---|---|
| 001 | acta12593 | ||
| 005 | 20220613152954.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 Blázsik Zoltán | |
| 245 | 1 | 3 | |a On decision-mappings related to process network synthesis problem |h [elektronikus dokumentum] / |c Blázsik Zoltán |
| 260 | |c 1998 | ||
| 300 | |a 319-328 | ||
| 490 | 0 | |a Acta cybernetica |v 13 No. 3 | |
| 520 | 3 | |a Process network synthesis (PNS) has enormous practical impact and a structural model can be given for it on the basis of a combinatorial approach. An important tool of this approach is the notion of the decision-mapping. In the present work, the number of the consistent decision-mappings is counted and an upper bound is presented for the number of the feasible solutions of a PNS problem. | |
| 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 Holló Csaba |e aut |
| 700 | 0 | 1 | |a Imreh Balázs |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12593/1/cybernetica_013_numb_003_319-328.pdf |z Dokumentum-elérés |