Results 201 to 210 of about 268,397 (277)
Mixed Integer Linear Programming based machine learning approach identifies regulators of telomerase in yeast. [PDF]
Poos AM +7 more
europepmc +1 more source
Farmer‐Led Strategies for Water Conservation in the Urmia Lake Basin, Iran
ABSTRACT This study examines the urgent issues of water scarcity and limited farmer livelihoods in the Urmia Lake basin. To address these challenges, we apply the Governance, Autonomy, Integration, and Needs orientation (GAIN) methodology. Our participatory approach revealed that farmers prioritised actionable measures for water management, yield ...
Sina Besharat +20 more
wiley +1 more source
Combinatorial therapy discovery using mixed integer linear programming. [PDF]
Pang K +6 more
europepmc +1 more source
ABSTRACT Introduction Perceived risk of experiencing NEET status (Not in Education, Employment, or Training) reflects young people's sense of vulnerability in the transition from school to work. Identifying protective factors linked with lower perceived risk may help inform early prevention.
Kati Kajastus
wiley +1 more source
AbstractBackgroundWe aimed to assess the prevalence of food insecurity reported by children and young people in four areas of England in 2023 and examine its association with mental health and wellbeing.MethodsWe used data from the OxWell student survey, a large, diverse, cross‐sectional study of 38,430 students aged 8–19 years, conducted primarily in ...
Giacomo Bignardi +3 more
wiley +1 more source
Optimising the selection of food items for FFQs using Mixed Integer Linear Programming. [PDF]
Gerdessen JC +3 more
europepmc +1 more source
Another Proof of the Generalized Tutte—Berge Formula for f $f$‐Bounded Subgraphs
ABSTRACT Given a nonnegative integer weight f ( v ) $f(v)$ for each vertex v $v$ in a multigraph G $G$, an f $f$‐bounded subgraph of G $G$ is a multigraph H $H$ contained in G $G$ such that d H ( v ) ≤ f ( v ) ${d}_{H}(v)\le f(v)$ for all v ∈ V ( G ) $v\in V(G)$.
Zishen Qu, Douglas B. West
wiley +1 more source
The Independence Ratio of 4‐Cycle‐Free Planar Graphs
ABSTRACT We prove that every n $n$‐vertex planar graph G $G$ with no triangle sharing an edge with a 4‐cycle has independence ratio n ∕ α ( G ) ≤ 4 − ε $n\unicode{x02215}\alpha (G)\le 4-\varepsilon $ for ε = 1 ∕ 30 $\varepsilon =1\unicode{x02215}30$. This result implies that the same bound holds for 4‐cycle‐free planar graphs and planar graphs with no ...
Tom Kelly +3 more
wiley +1 more source

