For set-valued information systems, there are many original dot-based approximation models based on tolerance relations and other developed relations. Because of the lack efficient algorithms, they not to accommodate bigger table. Therefore, it is a real challenge how efficiently calculate high-quality set in systems. To address challenge, we propose reliable operators semi-monolayer covering f...

where A is a mxn matrix of zeroes and ones, e = (1,...,1) is a vector of m ones and c is a vector of n (arbitrary) rational components. This pure 0-1 linear programming problem is called the set covering problem. When the inequalities are replaced by equations the problem is called the set partitioning problem, and when all of the ≥ constraints are replaced by ≤ constraints, the problem is call...

We study a generalization of the Set Cover problem called the Partial Set Cover in the context of geometric set systems. The input to this problem is a set system (X ,S), where X is a set of elements and S is a collection of subsets of X , and an integer k ≤ |X |. The goal is to cover at least k elements of X by using a minimum-weight collection of sets from S. In the geometric version, X typic...

The Set Covering Problem SCP is a main model for several important applications including crew scheduling in railway and mass transit companies In this survey we focus our attention on the most recent and e ective algo rithms for SCP considering both heuristic and exact approaches outlining their main characteristics and presenting an experimental comparison on the test bed instances of Beasley...