A dynamic programming heuristic for the \(P\)-median problem
From MaRDI portal
Publication:1278985
DOI10.1016/S0377-2217(96)00218-4zbMath0916.90179OpenAlexW1996395697WikidataQ126844554 ScholiaQ126844554MaRDI QIDQ1278985
Mark S. Daskin, Michelle R. Hribar
Publication date: 28 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00218-4
Related Items (10)
A neural model for the \(p\)-median problem ⋮ A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation ⋮ The \(p\)-median problem: a survey of metaheuristic approaches ⋮ A scatter search-based heuristic to locate capacitated transshipment points ⋮ Matheuristics: survey and synthesis ⋮ A Branch Decomposition Algorithm for the p-Median Problem ⋮ An effective heuristic for the \(P\)-median problem with application to ambulance location ⋮ On solving unreliable planar location problems ⋮ Mitigating partial-disruption risk: a joint facility location and inventory model considering customers' preferences and the role of substitute products and backorder offers ⋮ A hybrid of the Newton-GMRES and electromagnetic meta-heuristic methods for solving systems of nonlinear equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- A tree search algorithm for the p-median problem
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: A dynamic programming heuristic for the \(P\)-median problem
