Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
From MaRDI portal
Publication:1686519
DOI10.1007/s10479-015-1961-yzbMath1381.90043MaRDI QIDQ1686519
Publication date: 15 December 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-1961-y
Related Items
A trajectory based heuristic for the planar \(p\)-median problem, Extensions to the planar \(p\)-median problem, The planar multifacility collection depots location problem, Biologically inspired parent selection in genetic algorithms, A voltage drop limited decentralized electric power distribution network, The blockwise coordinate descent method for integer programs, Solving multiple facilities location problems with separated clusters, Multi-facility green Weber problem, Improved starting solutions for the planar p-median problem
Uses Software
Cites Work
- 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
- The big cube small cube solution method for multidimensional facility location problems
- General variable neighborhood search for the continuous optimization
- A tree search algorithm for the p-median problem
- GBSSS: The generalized big square small square method for planar single- facility location
- An optimal method for solving the (generalized) multi-Weber problem
- Heuristic concentration: Two stage solution construction
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- A projection method for \(l_ p\) norm location-allocation problems
- Variable neighborhood search
- Heuristic methods for large centroid clustering problems
- COBRA: A new formulation of the classic \(p\)-median location problem
- A new local search for continuous location problems
- BEAMR: an exact and approximate model for the \(p\)-median problem
- Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
- Solving Large p-Median Problems with a Radius Formulation
- Big segment small segment global optimization algorithm on networks
- On the Complexity of Some Common Geometric Location Problems
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- Location-Allocation Problems
- An Efficient Method for the Multi-Depot Location-Allocation Problem
- The Facility Location Problem with Limited Distances
- TSPLIB—A Traveling Salesman Problem Library
- Implementing vehicle routing algorithms
- Variable neighborhood search for the p-median
- Heuristic Methods for Location-Allocation Problems
- Decomposition strategies for large-scale continuous location–allocation problems
