Note on the equivalence of the set covering and process network synthesis problems

被引：0

作者：

Imreh, B.

Fulop, J.

Friedler, F.

机构：

来源：

Acta Cybernetica | 2000年 / 14卷 / 03期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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.

引用

页码：497 / 502

共 50 条

[1] A NOTE ON SOME COMPUTATIONALLY DIFFICULT SET COVERING PROBLEMS
AVIS, D
[J]. MATHEMATICAL PROGRAMMING, 1980, 18 (02) : 138 - 145
[2] A NOTE ON THE SET COVERING PROBLEM
BENVENISTE, R
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1982, 33 (03) : 261 - 265
[3] A NOTE ON THE EQUIVALENCE OF A SET OF EGDS TO A SET OF FDS
LEUCHNER, JH
MILLER, L
SLUTZKI, G
[J]. INFORMATION PROCESSING LETTERS, 1994, 49 (04) : 185 - 188
[4] Reoptimization of set covering problems
Mikhailyuk V.A.
[J]. Cybernetics and Systems Analysis, 2010, 46 (6) : 879 - 883
[5] A note on the Clustered Set Covering Problem
Alfandari, Laurent
Monnot, Jerome
[J]. DISCRETE APPLIED MATHEMATICS, 2014, 164 : 13 - 19
[6] On a new class of nonlinear set covering problems arising in wireless network design
Bosio, Sandro
[J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2008, 6 (02): : 183 - 186
[7] SET COVERING AND SET PARTITIONING - A COLLECTION OF TEST PROBLEMS
ELDARZI, E
MITRA, G
[J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1990, 18 (02): : 195 - 201
[8] On a new class of nonlinear set covering problems arising in wireless network design
Sandro Bosio
[J]. 4OR, 2008, 6 : 183 - 186
[9] Relation between set covering and set partitioning problems
Saxena, RR
Arora, SR
[J]. INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 1997, 28 (07): : 865 - 876
[10] ENHANCING AN ALGORITHM FOR SET COVERING PROBLEMS
BEASLEY, JE
JORNSTEN, K
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 58 (02) : 293 - 300

← 1 2 3 4 5 →