Results 81 to 90 of about 221,965 (288)
A Variable Neighborhood Search Approach for Solving the Maximum Set Splitting Problem [PDF]
, 2012 This paper presents a Variable neighbourhood search (VNS) approach for solving the Maximum Set Splitting Problem (MSSP). The algorithm forms a system of neighborhoods based on changing the component for an increasing number of elements.
Matic, Dragan
core
FEBS Open Bio, EarlyView.Bioscience students were asked for their opinions on the value and teaching of skills. 204 responded that teamwork, time management and study skills are necessary to reach University, that scientific writing, research, laboratory and presentation skills are taught effectively during their studies, while other skills are gained inherently through study ...
Janella Borrell, Susan Crennell
wiley +1 more source
Hybrid Variable Neighborhood HyperHeuristics for Exam Timetabling Problems [PDF]
, 2005 This paper presents our work on analysing the high level search within a graph based hyperheuristic. The graph based hyperheuristic solves the problem at a higher level by searching through permutations of graph heuristics rather than the actual ...
Burke, Edmund, Qu, Rong
core +3 more sources
Solving the Task Assignment Problem with a Variable Neighborhood Search [PDF]
, 2010 In this paper a variable neighborhood search (VNS) approach for the task assignment problem (TAP) is considered. An appropriate neighborhood scheme along with a shaking operator and local search procedure are constructed specifically for this problem ...
Filipović, Vladimir +3 more
core
Why human connection is the true metric of research success
FEBS Open Bio, EarlyView.Human‐centred mentorship can be shaped by mentor attributes, actions, intrinsic drive and career ambition. Drawing on reflections across Singapore and France, as well as workshop insights from FEBS‐IUBMB ENABLE 2024, this article shows that human‐centred mentorship creates the conditions for sustainable growth, well‐being and retention in research ...
Timothy Lin Yun Tan +3 more
wiley +1 more source
An efficient meta-heuristic algorithm for solving capacitated vehicle routing problem
IJAIN (International Journal of Advances in Intelligent Informatics), 2018 This work aims to develop an enhanced Perturbation based Variable Neighborhood Search with Adaptive Selection Mechanism (PVNS ASM) to solve the capacitated vehicle routing problem (CVRP).
Alfian Faiz +2 more
doaj +1 more source
Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems [PDF]
The generalized minimum spanning tree problem is a generalization of the minimum spanning tree problem. This network design problems finds several practical applications, especially when one considers the design of a large-capacity backbone network ...
Ghosh, Diptesh
core
Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem [PDF]
, 2013 In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented.
Maric, Miroslav
core
Neigborhood Selection in Variable Neighborhood Search
, 2011 Variable neighborhood search (VNS) is a metaheuristic for solving optimization problems based on a simple principle: systematic changes of neighborhoods within the search, both in the descent to local minima and in the escape from the valleys which contain them. Designing these neighborhoods and applying them in a meaningful fashion is not an easy task.
Geiger, Martin Josef +2 more
openaire +2 more sources
Aging and Cancer, EarlyView.This systematic review synthesizes prognostic models for survival and recurrence in resected non‐small cell lung cancer. While many models demonstrate moderate to good discrimination, few are externally validated and reporting quality is variable, limiting clinical applicability and highlighting the need for robust, transparent model development ...
Evangeline Samuel +4 more
wiley +1 more source