Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
From MaRDI portal
Publication:887199
DOI10.1007/s10898-014-0183-1zbMath1327.90090OpenAlexW2001516627MaRDI QIDQ887199
Nenad Mladenović, Jack Brimberg, Zvi Drezner, Said Salhi
Publication date: 28 October 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0183-1
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (3)
The planar multifacility collection depots location problem ⋮ \(k\)-means genetic algorithms with greedy genetic operators ⋮ A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new heuristic for solving the \(p\)-median problem in the plane
- New local searches for solving the multi-source Weber problem
- The big cube small cube solution method for multidimensional facility location problems
- Improving worst-case behavior of heaps
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- A projection method for \(l_ p\) norm location-allocation problems
- Variable neighborhood search
- Heuristic methods for large centroid clustering problems
- A new heuristic for the quadratic assignment problem
- The extended concentric tabu for the quadratic assignment problem
- A new local search for continuous location problems
- Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
- A New Genetic Algorithm for the Quadratic Assignment Problem
- IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
- On the Complexity of Some Common Geometric Location Problems
- Location-Allocation Problems
- Two algorithms for constructing a Delaunay triangulation
- Properties and Solution Methods for Large Location-Allocation Problems
- An Efficient Method for the Multi-Depot Location-Allocation Problem
- TSPLIB—A Traveling Salesman Problem Library
- Variable neighborhood search for the p-median
- A note on accelerating the weiszfeld procedure
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
- Heuristic Methods for Location-Allocation Problems
This page was built for publication: Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
