The following pages link to Variable Neighborhood Search (Q4452895):
Displayed 50 items.
- 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)
- Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry (Q2027046) (← links)
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches (Q2156989) (← links)
- An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms (Q2244241) (← links)
- Variable neighbourhood search for the minimum labelling Steiner tree problem (Q2267296) (← links)
- Merging the local and global approaches to probabilistic satisfiability (Q2270380) (← links)
- Variable neighbourhood search for bandwidth reduction (Q2379517) (← links)
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices (Q2462311) (← links)
- A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule (Q2464208) (← links)
- On local optima in multiobjective combinatorial optimization problems (Q2468765) (← links)
- Variable neighborhood search and local branching (Q2489139) (← links)
- Scheduling workover rigs for onshore oil production (Q2489895) (← links)
- First vs. best improvement: an empirical study (Q2489903) (← links)
- Variable neighborhood search for the linear ordering problem (Q2496057) (← links)
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem (Q2576247) (← links)
- Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search (Q2631238) (← links)
- Interrelated trips in the rural dial-a-ride problem with autonomous vehicles (Q2673572) (← links)
- A Simulated Annealing with Variable Neighborhood Search Approach to Construct Mixed Covering Arrays (Q2840782) (← links)
- Gaussian Variable Neighborhood Search and Enhanced Genetic Algorithm for Continuous Optimization (Q2840787) (← links)
- Exhaustive Search for Optimal Minimum Peak Sidelobe Binary Sequences up to Length 80 (Q2945081) (← links)
- VNSOptClust: A Variable Neighborhood Search Based Approach for Unsupervised Anomaly Detection (Q3627769) (← links)