Variable neighborhood decomposition search
From MaRDI portal
Publication:1850963
DOI10.1023/A:1011336210885zbMATH Open1041.68623OpenAlexW2152304735WikidataQ61773340 ScholiaQ61773340MaRDI QIDQ1850963FDOQ1850963
Authors: Pierre Hansen, Dionisio Pérez-Brito, Nenad Mladenović 
Publication date: 15 December 2002
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011336210885
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99) Combinatorial optimization (90C27)
Cited In (87)
- General VNS for asymmetric vehicle routing problem with time and capacity constraints
- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization
- Integrating order delivery and return operations for order fulfillment in an online retail environment
- A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm
- Variable neighborhood search: the power of change and simplicity
- The balanced \(p\)-median problem with unitary demand
- Revenue maximization of Internet of Things provider using variable neighbourhood search
- Improved metaheuristics for the quartet method of hierarchical clustering
- An investigation on compound neighborhoods for VRPTW
- Affinity propagation and uncapacitated facility location problems
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
- Aggregation tree construction using hierarchical structures
- Variable neighborhood descent applied to multi-way number partitioning problem
- A decision method on yard cranes transformation and deployment in green ports
- Exploiting separators for guiding VNS
- A predictive multistage postdisaster damage assessment framework for drone routing
- Metaheuristics: A Canadian Perspective
- An iterative local search approach applied to the optimal stratification problem
- Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- A variable neighborhood decomposition search method for supply chain management planning problems
- Categorical data fuzzy clustering: an analysis of local search heuristics
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
- Hybrid metaheuristic method for determining locations for long-term health care facilities
- Exploiting tree decomposition for guiding neighborhoods exploration for VNS
- Optimal partitioning of a data set based on the \(p\)-median model
- The \(p\)-median problem: a survey of metaheuristic approaches
- Dynamic vehicle routing using an improved variable neighborhood search algorithm
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
- Variable neighborhood search for harmonic means clustering
- Variable neighbourhood search: Methods and applications
- Variable neighborhood search: Principles and applications
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility
- Variable neighbourhood search: methods and applications
- Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector
- Exemplar-based clustering via simulated annealing
- Variable neighborhood tabu search and its application to the median cycle problem.
- Making a state-of-the-art heuristic faster with data mining
- On the integrated charge planning with flexible jobs in primary steelmaking processes
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation
- Computational study of large-scale \(p\)-median problems
- Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks
- Decomposition based hybrid metaheuristics
- An effective matheuristic for the capacitated total quantity discount problem
- Variable neighborhood search: basics and variants
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- Heuristic procedures for solving the discrete ordered median problem
- A fast swap-based local search procedure for location problems
- A metaheuristic to solve a location-routing problem with nonlinear costs
- Single string planning problem arising in liner shipping industries: a heuristic approach
- Variable neighborhood search for the pharmacy duty scheduling problem
- Combining VNS with constraint programming for solving anytime optimization problems
- Arbitrary-norm hyperplane separation by variable neighbourhood search
- Learning multicriteria fuzzy classification method PROAFTN from data
- An algorithm for minimizing clustering functions
- A unified framework for partial and hybrid search methods in constraint programming
- Metaheuristics in combinatorial optimization
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- Variable neighborhood search for the linear ordering problem
- An effective VNS for the capacitated \(p\)-median problem
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
- New diagonal bundle method for clustering problems in large data sets
- An aggregation heuristic for large scale p-median problem
- The maximum capture problem with random utilities: problem formulation and algorithms
- The stochastic capacitated branch restructuring problem
- Application of the cross-entropy method to clustering and vector quantization
- A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- The parallel variable neighborhood search for the \(p\)-median problem
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
- Heuristics for location models
- Fuzzy J-means: a new heuristic for fuzzy clustering
- A modified variable neighborhood search for the discrete ordered median problem
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Variable neighbourhood search for bandwidth reduction
- An incremental clustering algorithm based on hyperbolic smoothing
- Problems of discrete optimization: challenges and main approaches to solve them
- A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
This page was built for publication: Variable neighborhood decomposition search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850963)
