Results 51 to 60 of about 221,092 (272)
Variable neighborhood search for the Vertex Separation Problem
The vertex separation problem belongs to a family of optimization problems in which the objective is to nd the best separator of vertices or edges in a generic graph. This optimization problem is strongly related to other well-known graph problems; such as the Path-Width, the Node Search Number or the Interval Thickness, among others ...
Duarte, Abraham +5 more
openaire +2 more sources
ABSTRACT Bone tumours present significant challenges for affected patients, as multimodal therapy often leads to prolonged physical limitations. This is particularly critical during childhood and adolescence, as it can negatively impact physiological development and psychosocial resilience.
Jennifer Queisser +5 more
wiley +1 more source
A Hybrid Genetic Algorithm and Parallel Variable Neighborhood Search for Jobshop Scheduling With an Assembly Stage [PDF]
In this research a jobshop scheduling problem with an assembly stage is studied. The objective function is to find a schedule which minimizes completion time for all products. At first, a linear model is introduced to express the problem.
Parviz Fattahi +3 more
doaj +2 more sources
Greedy Optimization Method for Extractive Summarization of Scientific Articles
This work presents a method for summarizing scientific articles from the arXive and PubMed datasets using a greedy Extractive Summarization algorithm. We used the approach along with Variable Neighborhood Search (VNS) to learn what is the top-line exists
Iskander Akhmetov +2 more
doaj +1 more source
Variable Neighborhood Search for Edge-Ratio Network Clustering [PDF]
International audienceEdge-ratio clustering was introduced in [Cafieri et al., Phys.Rev. E 81(2):026105, 2010], as a criterion for optimal graph bipartitioning in hierarchical divisive algorithms for cluster identification in networks.
Cafieri, Sonia +2 more
core +1 more source
The role and implications of mammalian cellular circadian entrainment
At their most fundamental level, mammalian circadian rhythms occur inside every individual cell. To tell the correct time, cells must align (or ‘entrain’) their circadian rhythm to the external environment. In this review, we highlight how cells entrain to the major circadian cues of light, feeding and temperature, and the implications this has for our
Priya Crosby
wiley +1 more source
The static long-term power transmission network expansion planning problem consists in, given an initial configuration and the generation data and demand of the planning horizon, operation limits, costs and investment restrictions, to determine the ...
Silvia Lopes de Sena Taglialenha +1 more
doaj +1 more source
Orienteering problem with hotel selection: a variable neighborhood search method [PDF]
In this research, we developed a skewed variable neighbourhood search algorithm to solve the orienteering problem (OP) with hotel selection, a non-investigated variant of the OP.
Cattruysse, D +2 more
core +1 more source
MPI Parallelization of Variable Neighborhood Search
Abstract We analyze five parallelization strategies for the Variable Neighborhood Search (VNS) meta–heuristic. They are based on the asynchronous cooperative execution of several threads on different processors. Some of them are adapted from the recent literature, while the others are the newly proposed. We test parallelization on various levels, and
Tatjana Davidović +1 more
openaire +1 more source
Peptide‐based ligand antagonists block a Vibrio cholerae adhesin
The structure of a peptide‐binding domain of the Vibrio cholerae adhesin FrhA was solved by X‐ray crystallography, revealing how the inhibitory peptide AGYTD binds tightly at its Ca2+‐coordinated pocket. Structure‐guided design incorporating D‐amino acids enhanced binding affinity, providing a foundation for developing anti‐adhesion therapeutics ...
Mingyu Wang +9 more
wiley +1 more source

