On the reformulation of some classes of PNS-problems as set covering problems

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

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Process network synthesis (PNS) has enormous practical impact; however, its solution is difficult in general. This experience has been recently reasoned by Blázsik and Imreh who pointed out that PNS-problems are NP-hard. They proved that a simple subclass of PNS-problems is equivalent to the class of set covering problems. In the present paper, it is shown that more general classes of PNS-problems can also be reformulated as set covering problems. This enables the sophisticated techniques developed for solving set covering problems also to be applied for solving some PNS-problems.

Original languageEnglish
Pages (from-to)329-337
Number of pages9
JournalActa Cybernetica
Volume13
Issue number3
Publication statusPublished - 1998

Fingerprint

Set Covering Problem
Reformulation
Synthesis
Computational complexity
NP-complete problem
Class
Set covering problem

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Cite this

On the reformulation of some classes of PNS-problems as set covering problems. / Fülöp, J.; Imreh, B.; Friedler, F.

In: Acta Cybernetica, Vol. 13, No. 3, 1998, p. 329-337.

Research output: Contribution to journalArticle

@article{4aae478c16b045509bcfd91a13800a21,
title = "On the reformulation of some classes of PNS-problems as set covering problems",
abstract = "Process network synthesis (PNS) has enormous practical impact; however, its solution is difficult in general. This experience has been recently reasoned by Bl{\'a}zsik and Imreh who pointed out that PNS-problems are NP-hard. They proved that a simple subclass of PNS-problems is equivalent to the class of set covering problems. In the present paper, it is shown that more general classes of PNS-problems can also be reformulated as set covering problems. This enables the sophisticated techniques developed for solving set covering problems also to be applied for solving some PNS-problems.",
author = "J. F{\"u}l{\"o}p and B. Imreh and F. Friedler",
year = "1998",
language = "English",
volume = "13",
pages = "329--337",
journal = "Acta Cybernetica",
issn = "0324-721X",
publisher = "University of Szeged",
number = "3",

}

TY - JOUR

T1 - On the reformulation of some classes of PNS-problems as set covering problems

AU - Fülöp, J.

AU - Imreh, B.

AU - Friedler, F.

PY - 1998

Y1 - 1998

N2 - Process network synthesis (PNS) has enormous practical impact; however, its solution is difficult in general. This experience has been recently reasoned by Blázsik and Imreh who pointed out that PNS-problems are NP-hard. They proved that a simple subclass of PNS-problems is equivalent to the class of set covering problems. In the present paper, it is shown that more general classes of PNS-problems can also be reformulated as set covering problems. This enables the sophisticated techniques developed for solving set covering problems also to be applied for solving some PNS-problems.

AB - Process network synthesis (PNS) has enormous practical impact; however, its solution is difficult in general. This experience has been recently reasoned by Blázsik and Imreh who pointed out that PNS-problems are NP-hard. They proved that a simple subclass of PNS-problems is equivalent to the class of set covering problems. In the present paper, it is shown that more general classes of PNS-problems can also be reformulated as set covering problems. This enables the sophisticated techniques developed for solving set covering problems also to be applied for solving some PNS-problems.

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

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

M3 - Article

AN - SCOPUS:0242479564

VL - 13

SP - 329

EP - 337

JO - Acta Cybernetica

JF - Acta Cybernetica

SN - 0324-721X

IS - 3

ER -