Improved starting solutions for the planar p-median problem
From MaRDI portal
Publication:3388942
DOI10.2298/YJOR200315008BzbMath1474.90269arXiv2004.05510MaRDI QIDQ3388942
Publication date: 7 May 2021
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.05510
Related Items (3)
A trajectory based heuristic for the planar \(p\)-median problem ⋮ Extensions to the planar \(p\)-median problem ⋮ An elliptical cover problem in drone delivery network design and its solution algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New heuristic algorithms for solving the planar \(p\)-median problem
- A new heuristic for solving the \(p\)-median problem in the plane
- New local searches for solving the multi-source Weber problem
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- Variable neighborhood search
- The planar multifacility collection depots location problem
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
- Greedy randomized adaptive search procedures
- Biologically inspired parent selection in genetic algorithms
- A new local search for continuous location problems
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- On the Complexity of Some Common Geometric Location Problems
- Location-Allocation Problems
- TSPLIB—A Traveling Salesman Problem Library
- Variable neighborhood search for the p-median
- Heuristic Methods for Location-Allocation Problems
- Heuristics for Location Models
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Exact and approximate solutions to the multisource weber problem
This page was built for publication: Improved starting solutions for the planar p-median problem
