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

B. Imreh, J. Fülöp, F. Friedler

Research output: Contribution to journalArticle

2 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)497-502
Number of pages6
JournalActa Cybernetica
Issue number3
Publication statusPublished - Jan 1 1999



  • Combinatorial optimization
  • Complexity
  • Network design

ASJC Scopus subject areas

  • Software
  • Computer Science (miscellaneous)
  • Computer Vision and Pattern Recognition
  • Management Science and Operations Research
  • Information Systems and Management
  • Electrical and Electronic Engineering

Cite this