A parallel variable neighborhood search for -neighbor facility location problems
From MaRDI portal
Publication:6561237
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
- A note on solving large p-median problems
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- A scalable exact algorithm for the vertex \(p\)-center problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- An effective VNS for the capacitated \(p\)-median problem
- An improved simulated annealing algorithm for bandwidth minimization
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
- Fault tolerant \(K\)-center problems
- GRASP and VNS for solving the \(p\)-next center problem
- GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- Location science
- Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Solution methods for thep-median problem: An annotated bibliography
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- TSPLIB—A Traveling Salesman Problem Library
- The \(p\)-median problem: a survey of metaheuristic approaches
- The p-neighbor k-center problem
- The backup 2‐center and backup 2‐median problems on trees
- The probabilistic \(p\)-center problem: planning service for potential customers
- Variable neighborhood search
- Variable neighborhood search for the p-median
- Variable neighborhood search: the power of change and simplicity
This page was built for publication: A parallel variable neighborhood search for \(\alpha\)-neighbor facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561237)