The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...

we investigate the existence of some‎ ‎large sets of size nine‎. ‎the large set $ls[9](2,5,29)$ is constructed and‎ ‎existence of the family $ls[9](2,5,27l+j)$ for $lgeq 1, ‎2leq‎ ‎j

The article is a continuation of [1]. We define the following concepts: a function from a set X into a set Y , denoted by “Function of X ,Y ”, the set of all functions from a set X into a set Y , denoted by Funcs(X ,Y ), and the permutation of a set (mode Permutation of X , where X is a set). Theorems and schemes included in the article are reformulations of the theorems of [1] in the new termi...

the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...

the present paper introduces the notion of the complete fuzzy norm on a linear space. and, some relations between the fuzzy completeness and ordinary completeness on a linear space is considered, moreover a new form of fuzzy compact spaces, namely b-compact spaces and b-closed spaces are introduced. some characterizations of their properties are obtained.