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.
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
2000
|
| Series: | Acta cybernetica
14 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12643 |
| Summary: | 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. |
|---|---|
| Physical Description: | 497-502 |
| ISSN: | 0324-721X |