A note on the equivalence of the set covering and process network synthesis problems
AbstractIn 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.
Download data is not yet available.
How to Cite
Imreh, B., Fülöp, J., & Friedler, F. (2000). A note on the equivalence of the set covering and process network synthesis problems. Acta Cybernetica, 14(3), 497-502. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3544