A Note on the Equivalence of the Set Covering and Process Network Synthesis Problems
Acta Cybernetica 14 (2000) 497-501.
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.
Keywords : combinatorial optimization, network design, complexity.
1. This work has been supported by the Ministry of Education of Hungary, Grant FKFP 0008/1999. The research of the second author was supported in part by Hungarian National Research Foundation, Grant OTKA T016413. 2 Institute of Informatics, József Attila University, Árpád tér 2, H-6720 Szeged, Hungary 3. Laboratory of Operations Research and Decision Systems, Computer and Automation Institute, Hungarian Academy of Sciences, H-1518 Budapest, P.O.Box 63, Hungary 4. Department of Computer Science, University of Veszprém, Egyetem u. 10, H-8200 Veszprém, Hungary
Kocsorne Sebo Marianna7/5/2000