A note on the equivalence of the set covering and process network synthesis problems
In this paper, combining and completing some earlier results presented in this journal, it is proved that the Process Network Synthesis problem (PNS problem for short) is equivalent to the set covering problem.
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2000
|
| Sorozat: | Acta cybernetica
14 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12643 |
| Tartalmi kivonat: | In this paper, combining and completing some earlier results presented in this journal, it is proved that the Process Network Synthesis problem (PNS problem for short) is equivalent to the set covering problem. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 497-502 |
| ISSN: | 0324-721X |