Results 51 to 60 of about 2,347,375 (169)
Applied General Topology, 2022 A space X is said to be set star-Lindelöf if for each nonempty subset A of X and each collection U of open sets in X such that A ⊆⋃U, there is a countable subset V of U such that A ⊆ St (⋃V,U).
Sumit Singh
doaj +1 more source
A finite set covering theorem III [PDF]
Bulletin of the Australian Mathematical Society, 1972 Let n, s, t be integers with s > t > 2. If a family of n different subsets of a set S, with s elements, has the properties, (i) each member belongs to a set of (t+1) members which together have union S, (ii) no member belongs to a set of t members which together have union S, then we prove that n ≤ (t+1)s−t−1. The result is best possible.
Brace, Alan, Daykin, D. E.
openaire +3 more sources
Optimal Zero-Defect Solution for Multiple Inspection Items in Incoming Quality Control
MathematicsThis paper addresses the issues related to inaccurate inspections and high costs in incoming quality control. Incoming quality control refers to the initial inspection process that verifies whether externally provided products, materials, or services ...
Wenqing Zhou, Yufeng Chen
doaj +1 more source
Coverage Optimization with Balanced Capacitated Fragmentation
MathematicsThis paper investigates a specialized variant of the set covering problem, addressing the optimal allocation of service centers to ensure that all customers (or larger entities, such as urban areas) have access to specialized services within a predefined
Milos Seda, Pavel Seda
doaj +1 more source
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets [PDF]
, 2011 Consider the following problem: given a set system (U,I) and an edge-weighted graph G = (U, E) on the same universe U, find the set A in I such that the Steiner tree cost with terminals A is as large as possible: "which set in I is the most difficult to ...
Gupta, Anupam +2 more
core
Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1To appear in KDD ...
Mohsen Dehghankar +3 more
openaire +2 more sources
Application of genetic algorithm for the set-covering problem solution
Advanced Engineering Research, 2016 The weighed and unweighted minimal set-cover problem, its applicability for the solution of the major optimization practical tasks, such as arrangement of service points, assignment of crews in transport, as well as the integrated-circuit and conveyer ...
Igor S. Konovalov +2 more
doaj +1 more source
The Complexity of Computing Minimal Unidirectional Covering Sets
, 2009 Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability.
A. Meyer +56 more
core +6 more sources
Analytic Sets as Branched Coverings [PDF]
Transactions of the American Mathematical Society, 1972 In this paper we study the relation between the tangent structure of an analytic set V at a point p and the local representation of V as a branched covering. A prototype for our type of result is the fact that one obtains a covering of minimal degree by projecting transverse to the Zariski tangent cone C 3
openaire +2 more sources
Applications of set covering theory to the partitioning of political electoral constituencies [PDF]
, 1980 The present work reviews recent computer techniques to the constituency boundary problem. A computer technique based on the set-covering theory is developed and it is shown how the computer results based on the choice of objective can help decision ...
Ellah, Joseph Okey
core