Results 61 to 70 of about 2,347,375 (169)
The dynamic set covering próblem
Applied Mathematical Modelling, 1982 This paper addresses a dynamic version of the set covering formulation for facility location problems. The problem is characterized by 0–1 cover coefficients that may change value from one time period to the next. Included is a discussion of model formulation considerations, solution procedures and applications areas.
Chrissis, James W. +2 more
openaire +1 more source
On the Optimality of a Class of LP-based Algorithms [PDF]
, 2009 In this paper we will be concerned with a class of packing and covering problems which includes Vertex Cover and Independent Set. Typically, one can write an LP relaxation and then round the solution.
Kumar, Amit +3 more
core +2 more sources
New constructions for covering designs
, 1995 A $(v,k,t)$ {\em covering design}, or {\em covering}, is a family of $k$-subsets, called blocks, chosen from a $v$-set, such that each $t$-subset is contained in at least one of the blocks.
Gordon, Daniel +2 more
core +2 more sources
Knapsack with Vertex Cover, Set Cover, and Hitting Set
Given an undirected graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$, with vertex weights $(w(u))_{u\in\mathcal{V}}$, vertex values $(α(u))_{u\in\mathcal{V}}$, a knapsack size $s$, and a target value $d$, the \vcknapsack problem is to determine if there exists a subset $\mathcal{U}\subseteq\mathcal{V}$ of vertices such that $\mathcal{U}$ forms a vertex ...
Dey, Palash +3 more
openaire +4 more sources
Hard Capacitated Set Cover and Uncapacitated Geometric Set Cover
, 2016 The first part of this report describes the following result that, logarithmic approximation factor for hard capacitated set cover can be achieved from Wolsey's work [9], using a simpler and more intuitive analysis. We further show in our work, that O(log n) approximation factor can be achieved for the same problem by applying analysis of general set ...
openaire +2 more sources
A Uniform Set Covering Lemma [PDF]
Proceedings of the American Mathematical Society, 1975 The bounded set system H = (V, i) is composed of a nonvoid set V and a set, S, of nonvoid subsets of V, a finite number of which cover V. C C V is a critical subset of H if every proper subset of C requires fewer members of X to cover it than are needed to cover C.
openaire +2 more sources
About a certain NP complete problem
, 2020 In this article we introduce the concept of special decomposition of a set and the concept of special covering of a set under such a decomposition. We study the conditions for existence of special coverings of the sets, under the special decomposition of
Margaryan, Stepan
core
Three-Way Decisions Making Using Covering Based Fractional Orthotriple Fuzzy Rough Set Model
Mathematics, 2020 On the basis of decision-theoretical rough sets (DTRSs), the three-way decisions give new model of decision approach for deal with the problem of decision. This proposed model of decision method is based on the loss function of DTRSs.
Shougi S. Abosuliman +2 more
doaj +1 more source
A high-adaptability nozzle-array printing system based on a set covering printing planning model for printed display manufacturing. [PDF]
Sci Rep, 2023 Wang Y, Chen J, Yin Z, Li Y.
europepmc +1 more source
A Local Branching Approach for the Set Covering Problem
International Journal of Industrial Engineering and Production Research, 2014 The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP.
Masoud Yaghini +2 more
doaj