Variable Neighborhood Search
From MaRDI portal
Publication:4452895
DOI10.1007/0-306-48056-5_6zbMATH Open1102.90371OpenAlexW4211231030WikidataQ61773343 ScholiaQ61773343MaRDI QIDQ4452895FDOQ4452895
Authors: Pierre Hansen, Nenad Mladenović 
Publication date: 7 March 2004
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.635.7056
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Search theory (90B40) Nonlinear programming (90C30)
Cited In (only showing first 100 items - show all)
- Learning variable neighborhood search for a scheduling problem with time windows and rejections
- Local and variable neighborhood search for the \(k\) -cardinality subgraph problem
- Efficient algorithms for cluster editing
- An overview of graph covering and partitioning
- Variable Neighborhood Search Approach for Solving Roman and Weak Roman Domination Problems on Graphs
- A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section
- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization
- Consistent neighborhood search for combinatorial optimization
- Enhanced meta-heuristics with variable neighborhood search strategy for combinatorial optimization problems
- Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search
- General variable neighborhood search approach to group Steiner tree problem
- Variable neighborhood search approach to community detection problem
- A simulated annealing with variable neighborhood search approach to construct mixed covering arrays
- Gaussian variable neighborhood search for the file transfer scheduling problem
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
- An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms
- Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry
- Solving the capacitated clustering problem with variable neighborhood search
- Across neighborhood search algorithm: a comprehensive analysis
- A note on ``Variable neighborhood search based algorithms for crossdock truck assignment
- Variable neighbourhood search
- The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches
- Variable neighborhood search: basics and variants
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Fundamentals of variable neighborhood search
- Variable neighborhood search in global optimization
- Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm
- Editorial to the special cluster on variable neighborhood search, variants and recent applications
- Interrelated trips in the rural dial-a-ride problem with autonomous vehicles
- An algorithmic framework for generating optimal two-stratum experimental designs
- Variable neighborhood search approach for the location and design problem
- Fuzzy optimization for distribution of frozen food with imprecise times
- Variable neighbourhood structures for cycle location problems
- Preface to the special issue on variable neighborhood search
- Packing unit spheres into a cube using VNS
- Variable neighbourhood search for financial derivative problem
- General variable neighborhood search for computing graph separators
- Variable neighborhood search for graphical model energy minimization
- Intensification neighborhoods for local search methods
- Feature selection in machine learning via variable neighborhood search
- Learning cluster-based structure to solve constraint satisfaction problems
- New VNP for automatic programming
- Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots
- Exhaustive search for optimal minimum peak sidelobe binary sequences up to length 80
- Heuristics for a flowshop scheduling problem with stepwise job objective function
- Variable neighborhood descent heuristic for covering design problem
- Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments
- Title not available (Why is that?)
- Variable neighbourhood search for redundancy allocation problems
- Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
- First vs. best improvement: an empirical study
- A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule
- Scheduling workover rigs for onshore oil production
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
- Variable neighborhood search for maximum diverse grouping problem
- Risk approaches for delivering disaster relief supplies
- Variable neighborhood search for solving the balanced location problem
- Variable neighborhood search for the strong metric dimension problem
- Variable neighborhood search method for optimizing the emergency service network of police special forces units
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem
- A variable neighborhood search for graph coloring.
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
- A review of hyper-heuristics for educational timetabling
- A variable neighborhood search based algorithm for finite-horizon Markov decision processes
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
- Variable neighbourhood search: Methods and applications
- Attraction probabilities in variable neighborhood search
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- Variable neighborhood search: Principles and applications
- Variable neighbourhood search: methods and applications
- Exact and heuristic solutions of the global supply chain problem with transfer pricing
- Variable neighborhood tabu search and its application to the median cycle problem.
- A priori orienteering with time windows and stochastic wait times at customers
- Variable neighborhood search for location routing
- An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
- Metaheuristics for solving a multimodal home-healthcare scheduling problem
- Exact and approximate algorithms for variable selection in linear discriminant analysis
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- Securing home health care in times of natural disasters
- Product line pricing for services with capacity constraints and dynamic substitution
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- Merging the local and global approaches to probabilistic satisfiability
- Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism
- GRASP and path relinking for the equitable dispersion problem
- Single string planning problem arising in liner shipping industries: a heuristic approach
- Scheduled penalty variable neighborhood search
- Variable neighborhood search for the pharmacy duty scheduling problem
- Combining VNS with constraint programming for solving anytime optimization problems
- Variable neighborhood search for minimum cost berth allocation
- Solving the quadratic minimum spanning tree problem
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- Metaheuristics in combinatorial optimization
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
- Shop scheduling in manufacturing environments: a review
- Models and heuristics for the \(k\)-degree constrained minimum spanning tree problem with node-degree costs
This page was built for publication: Variable Neighborhood Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452895)
