The parallel variable neighborhood search for the p-median problem
From MaRDI portal
(Redirected from The parallel variable neighborhood search for the p-median problem)
The parallel variable neighborhood search for the \(p\)-median problem
The parallel variable neighborhood search for the \(p\)-median problem
Recommendations
Cited in
(35)- Variable neighbourhood search: Methods and applications
- A revised variable neighborhood search for the discrete ordered median problem
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
- A Lagrangian search method for the \(P\)-median problem
- Variable neighborhood search: basics and variants
- A facility location model for air pollution detection
- Variable neighborhood decomposition search
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
- Near-optimal large-scale k-medoids clustering
- A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
- Neighborhood structures for the container loading problem: a VNS implementation
- A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm
- An approach for solving competitive location problems with variable demand using multicore systems
- The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
- MPI parallelization of variable neighborhood search
- Variable neighborhood search for the pharmacy duty scheduling problem
- Parallel Variable Neighborhood Search
- Algorithms for the maximum k-club problem in graphs
- Variable neighborhood search for the p-median
- An efficient neural network algorithm for the p-median problem
- A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location
- Discrete facility location in machine learning
- Parallel variable neighborhood search for the min-max order batching problem
- Parallel variable neighbourhood search strategies for the cutwidth minimization problem
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- Variable neighborhood search: the power of change and simplicity
- A variable neighborhood search for the median location problem with interconnected facilities
- An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system
- The \(p\)-median problem: a survey of metaheuristic approaches
- Computational study of large-scale p-median problems
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
- Variable neighbourhood search: methods and applications
- Vehicle dispatching algorithms for container transshipment hubs
This page was built for publication: The parallel variable neighborhood search for the \(p\)-median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850991)
