The parallel variable neighborhood search for the \(p\)-median problem
From MaRDI portal
Publication:1850991
DOI10.1023/A:1015013919497zbMath1012.68796OpenAlexW1500617096MaRDI QIDQ1850991
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:1015013919497
Approximation methods and heuristics in mathematical programming (90C59) Parallel algorithms in computer science (68W10)
Related Items (26)
Parallel variable neighborhood search for the min–max order batching problem ⋮ A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm ⋮ Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies ⋮ Variable neighborhood search for the pharmacy duty scheduling problem ⋮ A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups ⋮ The \(p\)-median problem: a survey of metaheuristic approaches ⋮ Computational study of large-scale \(p\)-median problems ⋮ A Lagrangian search method for the \(P\)-median problem ⋮ Algorithms for the maximum \(k\)-club problem in graphs ⋮ Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem ⋮ Discrete facility location in machine learning ⋮ A parallel variable neighborhood search approach for the obnoxious p‐median problem ⋮ Variable neighborhood search: the power of change and simplicity ⋮ Variable neighborhood search: basics and variants ⋮ A facility location model for air pollution detection ⋮ An approach for solving competitive location problems with variable demand using multicore systems ⋮ A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows ⋮ Variable neighbourhood search: methods and applications ⋮ Neighborhood structures for the container loading problem: a VNS implementation ⋮ Vehicle dispatching algorithms for container transshipment hubs ⋮ Near-optimal large-scale k-medoids clustering ⋮ Variable neighbourhood search: Methods and applications ⋮ A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem ⋮ MPI Parallelization of Variable Neighborhood Search ⋮ A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location ⋮ An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system
This page was built for publication: The parallel variable neighborhood search for the \(p\)-median problem
