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)

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.

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

Fingerprint

Set Covering
Equivalence
Synthesis
Set Covering Problem
Set covering problem

Keywords

  • Combinatorial optimization
  • Complexity
  • Network design

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Cite this

A note on the equivalence of the set covering and process network synthesis problems. / Imreh, B.; Fülöp, J.; Friedler, F.

In: Acta Cybernetica, Vol. 14, No. 3, 1999, p. 497-502.

Research output: Contribution to journalArticle

@article{7ef557e4e1564a909243fb8c117356f6,
title = "A note on the equivalence of the set covering and process network synthesis problems",
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.",
keywords = "Combinatorial optimization, Complexity, Network design",
author = "B. Imreh and J. F{\"u}l{\"o}p and F. Friedler",
year = "1999",
language = "English",
volume = "14",
pages = "497--502",
journal = "Acta Cybernetica",
issn = "0324-721X",
publisher = "University of Szeged",
number = "3",

}

TY - JOUR

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

AU - Imreh, B.

AU - Fülöp, J.

AU - Friedler, F.

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

KW - Combinatorial optimization

KW - Complexity

KW - Network design

UR - http://www.scopus.com/inward/record.url?scp=30844433741&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=30844433741&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:30844433741

VL - 14

SP - 497

EP - 502

JO - Acta Cybernetica

JF - Acta Cybernetica

SN - 0324-721X

IS - 3

ER -