A note on the equivalence of the set covering and process network synthesis problems

  • Balázs Imreh
  • János Fülöp
  • Ferenc Friedler

Abstract

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.

Downloads

Download data is not yet available.
Published
2000-01-01
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
Issue
Vol 14 No 3 (2000)
Section
Regular articles