Results 131 to 140 of about 504,784 (313)
Set-Covering Problem: Frank-Wolfe algorithm implementation for the linear relaxation
openIl problema del Set-Covering (Set-Covering Problem, SCP) è un problema di ottimizzazione combinatoria che consiste nel determinare la più piccola collezione di elementi in una famiglia di sottoinsiemi di un insieme, in modo che ciascun elemento di ...
CALLEGARI, LEONARDO
core
Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim +3 more
wiley +1 more source
Background. The object of the research is the energy supply system for spatially distributed groups of aerial objects. The subject of the research is algorithms for forming optimal clusters for simultaneous energy transmission to multiple unmanned aerial
A.A. Chepiga
doaj +1 more source
Binary Chaotic White Shark Optimizer for the Unicost Set Covering Problem
The Unicost Set Covering Problem (USCP), an NP-hard combinatorial optimization challenge, demands efficient methods to minimize the number of sets covering a universe.
Pablo Zúñiga-Valenzuela +6 more
doaj +1 more source
Crew Scheduling for Netherlands Railways: "destination: customer"
: In this paper we describe the use of a set covering model with additional constraints for scheduling train drivers and conductors for the Dutch railway operator NS Reizigers.
Fischetti, M., Kroon, L.G.
core
Hierarchical location-allocation models for congested systems [PDF]
In this paper we address the issue of locating hierarchical facilities in the presence of congestion. Two hierarchical models are presented, where lower level servers attend requests first, and then, some of the served customers are referred to higher ...
Daniel Serra, Vladimir Marianov
core
The minimal covering set in large tournaments
We prove that in almost all large tournaments, the minimal covering set is the entire set of alternatives. That is, as the number of alternatives gets large, the probability that the minimal covering set of a uniformly chosen random tournament is the ...
Scott, A, Fey, M
core +1 more source
Breast cancer remains a major cause of cancer death in women, frequently developing endocrine therapy resistance. This study demonstrates that upregulated p21‐activated kinase 1 (PAK1) activity drives resistance to tamoxifen and long‐term estrogen deprivation in ER+ breast cancer models.
Luisa Schwarzmüller +10 more
wiley +1 more source
Approximation algorithms for rectangle stabbing and interval stabbing problems. [PDF]
Inthe weighted rectangle stabbing problem we are given a grid in R2 consisting of columns and rows each having a positive integral weight, and a set of closed axis-parallel rectangles each having a positive integral demand.
Kovaleva, S, Spieksma, Frederik
core
RoboMic is an automated confocal microscopy pipeline for high‐throughput functional imaging in living cells. Demonstrated with fluorescence recovery after photobleaching (FRAP), it integrates AI‐driven nuclear segmentation, ROI selection, bleaching, and analysis.
Selçuk Yavuz +6 more
wiley +1 more source

