Variable neighborhood search: basics and variants
type: Item
instance of: scholarly article
title: Variable neighborhood search: basics and variants
zbMATH Open document ID: 1390.90586
author: Pierre Hansen
author: Nenad Mladenović
author: Raca Todosijević
author: Saïd Hanafi
published in: EURO Journal on Computational Optimization
publication date: 2018-03-28T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6854272
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: metaheuristic
zbMATH Keywords: heuristic
describes a project that uses: GLOB
describes a project that uses: FEASPUMP
describes a project that uses: TSPLIB
describes a project that uses: SNOPT
describes a project that uses: MINLPLib
MaRDI profile type: Publication
full work available at URL: s13675-016-0075-x
OpenAlex ID: W2516530272
cites work: Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
cites work: Pooling Problem: Alternate Formulations and Solution Methods
cites work: Pivot and Complement–A Heuristic for 0-1 Programming
cites work: A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
cites work: A heuristic for nonlinear global optimization
cites work: MINLPLib -- a collection of test models for mixed-integer nonlinear programming
cites work: Gaussian variable neighborhood search for continuous optimization
cites work: Variable neighborhood search for minimum sum-of-squares clustering on networks
cites work: MPI parallelization of variable neighborhood search
cites work: Neighborhood portfolio approach for local search applied to timetabling problems
cites work: A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule
cites work: Continuous variable neighbourhood search with modified Nelder–Mead for non-differentiable optimization
cites work: Q5492524
cites work: The feasibility pump
cites work: Local branching
cites work: Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
cites work: The parallel variable neighborhood search for the \(p\)-median problem
cites work: SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
cites work: Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility
cites work: Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem
cites work: Primal-dual variable neighborhood search for the simple plant-location problem
cites work: First vs. best improvement: an empirical study
cites work: Variable neighbourhood search: methods and applications
cites work: Variable neighborhood decomposition search
cites work: Variable neighborhood search and local branching
cites work: A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
cites work: Q4365133
cites work: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
cites work: Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
cites work: Double variable neighbourhood search with smoothing for the molecular distance geometry problem
cites work: A recipe for finding good solutions to MINLPs
cites work: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
cites work: General variable neighborhood search for the continuous optimization
cites work: Variable neighborhood search
cites work: Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
cites work: Reformulation descent applied to circle packing problems
cites work: An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
cites work: Two level general variable neighborhood search for attractive traveling salesman problem
cites work: A hybrid variable neighborhood search algorithm for targeted offers in direct marketing
cites work: Ejection chain and filter-and-fan methods in combinatorial optimization
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
cites work: Parallel variable neighbourhood search algorithms for job shop scheduling problems
cites work: Nested general variable neighborhood search for the periodic maintenance problem
cites work: A general variable neighborhood search for the swap-body vehicle routing problem
cites work: A general variable neighborhood search variants for the travelling salesman problem with draft limits
cites work: VNS based heuristic for solving the unit commitment problem
cites work: A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
cites work: Solving the unconstrained optimization problem by a variable neighborhood search
cites work: Multi-neighborhood tabu search for the maximum weight clique problem
cites work: A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
cites work: A restarted and modified simplex search for unconstrained optimization
DOI: 10.1007/S13675-016-0075-X
description: scientific article; zbMATH DE number 6854272