Results 41 to 50 of about 221,965 (288)
Local Branching in a Constraint Programming Framework [PDF]
, 2010 We argue that integrating local branching in CP merges the advantages of the intensification and diversification mechanisms specific to local search methods, with constraint propagation that speeds up the neighborhood exploration by removing infeasible ...
Parisini, Fabio
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background An international Delphi panel of experts developed consensus statements to delineate the circumstances where the risks of dexamethasone as an antiemetic do and do not outweigh its benefits. Procedure Experts in supportive care of pediatric patients were invited to participate.
Negar Shavandi +20 more
wiley +1 more source
Complex System Modeling and Simulation, 2023 Developing a reasonable and efficient emergency material scheduling plan is of great significance to decreasing casualties and property losses. Real-world emergency material scheduling (EMS) problems are typically large-scale and possess complex ...
Zhen Shu +3 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Objective To evaluate the diagnostic yield and utility of universal paired tumor–normal multigene panel sequencing in newly diagnosed pediatric solid and central nervous system (CNS) tumor patients and to compare the detection of germline pathogenic/likely pathogenic variants (PV/LPVs) against established clinical referral criteria for cancer ...
Natalie Waligorski +9 more
wiley +1 more source
A Survey on Variable Neighborhood Search for Sustainable Logistics
AlgorithmsSustainable logistics aims to balance economic efficiency, environmental responsibility, and social well-being in supply chain operations. This study explores the use of Variable Neighborhood Search (VNS), a metaheuristic optimization method, in ...
Jesica de Armas, José A. Moreno-Pérez
doaj +1 more source
Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm
Journal of Applied Mathematics, 2013 In order to effectively solve the dynamic vehicle routing problem with time windows, the mathematical model is established and an improved variable neighborhood search algorithm is proposed.
Yingcheng Xu, Li Wang, Yuexiang Yang
doaj +1 more source
Edge-ratio network clustering by Variable Neighborhood Search [PDF]
The European Physical Journal B, 2014 The analysis of networks and in particular the identification of communities, or clusters, is a topic of active research with application arising in many domains. Several models were proposed for its solution. In [Cafieri et al., Phys. Rev. E 81(2):026105, 2010], a criterion is proposed for a graph bipartition to be optimal: one seeks to maximize the ...
Cafieri, Sonia +2 more
openaire +2 more sources
European Journal of Operational Research, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lai, Xiangjing +3 more
openaire +3 more sources
In situ molecular organization and heterogeneity of the Legionella Dot/Icm T4SS
FEBS Letters, EarlyView.We present a nearly complete in situ model of the Legionella Dot/Icm type IV secretion system, revealing its central secretion channel and identifying new components. Using cryo‐electron tomography with AI‐based modeling, our work highlights the structure, variability, and mechanism of this complex nanomachine, advancing understanding of bacterial ...
Przemysław Dutka +11 more
wiley +1 more source
Efficient Hill Climber for Constrained Pseudo-Boolean Optimization Problems [PDF]
, 2016 Efficient hill climbers have been recently proposed for single- and multi-objective pseudo-Boolean optimization problems. For $k$-bounded pseudo-Boolean functions where each variable appears in at most a constant number of subfunctions, it has been ...
Chicano, Francisco +2 more
core +1 more source