FUZZY SET COVERING PROBLEM

被引：7

作者：

ZIMMERMANN, K

机构：

[1] Faculty of Mathematics and Physics, Charles University, Prague

来源：

INTERNATIONAL JOURNAL OF GENERAL SYSTEMS | 1991年 / 20卷 / 01期

关键词：

SET COVERING PROBLEM; CHEAPEST FUZZY SET COVERING; MIN-MAX OPTIMIZATION PROBLEMS; NP-HARD PROBLEMS;

D O I：

10.1080/03081079108945020

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The classical set covering problem is one of the well known NP-hard problems from discrete optimization. It consists of finding the cheapest covering of a finite set with a subsystem of a Finite system of its subsets and has been investigated by many authors in various formulations. Here, two formulations are considered and corresponding results are presented. © 1991, Taylor & Francis Group, LLC. All rights reserved.

引用

页码：127 / 131

页数：5