The following pages link to Variable Neighborhood Search (Q4452895):
Displaying 50 items.
- A review of hyper-heuristics for educational timetabling (Q284387) (← links)
- A priori orienteering with time windows and stochastic wait times at customers (Q297061) (← links)
- Metaheuristics for solving a multimodal home-healthcare scheduling problem (Q301481) (← links)
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container (Q322528) (← links)
- Single string planning problem arising in liner shipping industries: a heuristic approach (Q336521) (← links)
- GRASP and path relinking for the equitable dispersion problem (Q336711) (← links)
- Variable neighborhood search for location routing (Q339539) (← links)
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem (Q342275) (← links)
- A bi-objective approach for scheduling ground-handling vehicles in airports (Q342334) (← links)
- Solving the quadratic minimum spanning tree problem (Q387698) (← links)
- A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
- Product line pricing for services with capacity constraints and dynamic substitution (Q439681) (← links)
- Exact and approximate algorithms for variable selection in linear discriminant analysis (Q452539) (← links)
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (Q477965) (← links)
- Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism (Q604940) (← links)
- Learning cluster-based structure to solve constraint satisfaction problems (Q647439) (← links)
- Securing home health care in times of natural disasters (Q647524) (← links)
- Risk approaches for delivering disaster relief supplies (Q647529) (← links)
- Construction and improvement algorithms for dispersion problems (Q726217) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem (Q932175) (← links)
- Variable neighborhood search for minimum cost berth allocation (Q932179) (← links)
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem (Q932185) (← links)
- Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks (Q932187) (← links)
- General variable neighborhood search for the continuous optimization (Q932193) (← links)
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints (Q932216) (← links)
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search (Q953317) (← links)
- Local and variable neighborhood search for the \(k\) -cardinality subgraph problem (Q953319) (← links)
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem (Q953320) (← links)
- Alternating local search based VNS for linear classification (Q970175) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm (Q972655) (← links)
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem (Q976311) (← links)
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem (Q1014948) (← links)
- Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem (Q1025243) (← links)
- Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem (Q1027523) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report (Q1038282) (← links)
- Exact and heuristic solutions of the global supply chain problem with transfer pricing (Q1041020) (← links)
- Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis (Q1048653) (← links)
- An algorithmic framework for generating optimal two-stratum experimental designs (Q1658390) (← links)
- General variable neighborhood search for computing graph separators (Q1677293) (← links)
- Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments (Q1707498) (← links)
- Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
- Variable neighborhood descent with iterated local search for routing and wavelength assignment (Q1761137) (← links)
- Local search neighbourhoods for dealing with a novel nurse rostering model (Q1761887) (← links)
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine (Q1762139) (← links)
- Reformulation descent applied to circle packing problems (Q1772872) (← links)
- Fuzzy optimization for distribution of frozen food with imprecise times (Q1927273) (← links)
