Incorporating neighborhood reduction for the solution of the planar p-median problem
From MaRDI portal
Publication:1686519
DOI10.1007/S10479-015-1961-YzbMATH Open1381.90043OpenAlexW1144451890MaRDI QIDQ1686519FDOQ1686519
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
Recommendations
- New heuristic algorithms for solving the planar \(p\)-median problem
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
- A new heuristic for solving the \(p\)-median problem in the plane
- Large neighborhood search for the \(p\)-median problem
- Large neighborhood local search for the \(p\)-median problem
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- An optimal method for solving the (generalized) multi-Weber problem
- A projection method for \(l_ p\) norm location-allocation problems
- COBRA: A new formulation of the classic \(p\)-median location problem
- Location-Allocation Problems
- Heuristic Methods for Location-Allocation Problems
- Decomposition strategies for large-scale continuous location–allocation problems
- Variable neighborhood search
- On the Complexity of Some Common Geometric Location Problems
- GBSSS: The generalized big square small square method for planar single- facility location
- Big segment small segment global optimization algorithm on networks
- A new heuristic for solving the \(p\)-median problem in the plane
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- The big cube small cube solution method for multidimensional facility location problems
- Solving large \(p\)-median problems with a radius formulation
- Variable neighborhood search for the p-median
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- A new local search for continuous location problems
- General variable neighborhood search for the continuous optimization
- Heuristic methods for large centroid clustering 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
- New heuristic algorithms for solving the planar \(p\)-median problem
- Title not available (Why is that?)
- An Efficient Method for the Multi-Depot Location-Allocation Problem
- The Facility Location Problem with Limited Distances
- Implementing vehicle routing algorithms
- New local searches for solving the multi-source Weber problem
- A tree search algorithm for the p-median problem
- Heuristic concentration: Two stage solution construction
Cited In (9)
- Multi-facility green Weber problem
- Improved starting solutions for the planar p-median problem
- Extensions to the planar \(p\)-median problem
- Biologically inspired parent selection in genetic algorithms
- Solving multiple facilities location problems with separated clusters
- A voltage drop limited decentralized electric power distribution network
- A trajectory based heuristic for the planar \(p\)-median problem
- The blockwise coordinate descent method for integer programs
- The planar multifacility collection depots location problem
Uses Software
This page was built for publication: Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686519)
