Results 111 to 120 of about 504,784 (313)
Utilizing Heuristics and Metaheuristics for Solving the Set Covering Problem
U.Porto Journal of EngineeringA basic combinatorial optimization problem, the Set Covering Problem (SCP) finds extensive use in computer science, operations research, and logistics, among other domains.
Lourenço Sousa de Pinho
doaj +1 more source
Molecular Oncology, EarlyView.Many patients with urothelial cancer do not benefit from treatment with pembrolizumab, while at risk of severe side effects. Changes in the levels of circulating tumor DNA early during treatment, measured by a simple and affordable assay that can be easily implemented in the clinic, can be used as a prognostic tool to identify these patients.
Youssra Salhi +14 more
wiley +1 more source
A Novel Approach to Combinatorial Problems: Binary Growth Optimizer Algorithm
BiomimeticsThe set-covering problem aims to find the smallest possible set of subsets that cover all the elements of a larger set. The difficulty of solving the set-covering problem increases as the number of elements and sets grows, making it a complex problem for
Dante Leiva +4 more
doaj +1 more source
On Covering Approximation Subspaces [PDF]
Computer Science Journal of Moldova, 2009 Let (U';C') be a subspace of a covering approximation space (U;C) and X⊂U'. In this paper, we show that and B'(X)⊂B(X)∩U'. Also, iff (U;C) has Property Multiplication. Furthermore, some connections between outer (resp. inner) definable subsets in (U;C)
Xun Ge
doaj
Efficiency comparison of exact and approximate algorithms for solving set covering problem
Advanced Engineering Research, 2017 Introduction. A quite general class of practical tasks is guided by the set covering problem: schedules building, layout of service stations, and creation of electronic circuits.
Igor S. Konovalov +2 more
doaj +1 more source
Hyperbolic set covering problems with competing ground-set elements
, 2011 Motivated by a challenging problem arising in wireless network design, we investigate a new nonlinear variant of the set covering problem with hyperbolic objective function.
S. Bosio +5 more
core +1 more source
MITF maintains genome stability in nonmelanocyte lineages
Molecular Oncology, EarlyView.MITF is essential for melanocyte survival and acts as an oncogene in 10%–20% of melanomas. We show that MITF depletion causes genome instability in nonmelanocytic cells, leading to LATS2‐mediated P53 activation, cell cycle arrest, and apoptosis. This study highlights the role of MITF as a genome maintenance factor beyond the melanocyte lineage. Created
Drifa H. Gudmundsdottir +13 more
wiley +1 more source
A Variable Precision Covering-Based Rough Set Model Based on Functions
The Scientific World Journal, 2014 Classical rough set theory is a technique of granular computing for handling the uncertainty, vagueness, and granularity in information systems. Covering-based rough sets are proposed to generalize this theory for dealing with covering data.
Yanqing Zhu, William Zhu
doaj +1 more source
Application of Set Covering Location Problem for Organizing the Public Postal Network
Promet (Zagreb), 2016 Most countries of the European Union ensure certain obligations (criteria) which universal service providers must meet to ensure the realization of the universal service.
Dragana Šarac +4 more
doaj +1 more source
An application of the Lovasz-Schrijver M(K,K) operator to the stable set problem [PDF]
, 2009 Although the lift-and-project operators of Lovász and Schrijver have been the subject of intense study, their M(K, K) operator has received little attention. We consider an application of this operator to the stable set problem.
Rossi, F +3 more
core