A dynamic programming heuristic for the P-median problem
From MaRDI portal
Publication:1278985
DOI10.1016/S0377-2217(96)00218-4zbMATH Open0916.90179OpenAlexW1996395697WikidataQ126844554 ScholiaQ126844554MaRDI QIDQ1278985FDOQ1278985
Authors: Mark S. Daskin, M. 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
Recommendations
- A new heuristic approach for the P-median problem
- A hybrid heuristic for the \(p\)-median problem
- scientific article; zbMATH DE number 1286021
- An efficient heuristic algorithm for the capacitated \(p\)-median problem
- A gamma heuristic for the \(p\)-median problem
- A computational study for the \(p\)-median problem
- A new heuristic for solving the \(p\)-median problem in the plane
- Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem
- scientific article; zbMATH DE number 3915986
- Heuristic procedures for solving the discrete ordered median problem
Cites Work
- Title not available (Why is that?)
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Title not available (Why is that?)
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- A tree search algorithm for the p-median problem
Cited In (25)
- Sequential zone adjustment for approximate solving of large p-median 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 computational study for the \(p\)-median problem
- On solving unreliable planar location problems
- The \(p\)-median problem: a survey of metaheuristic approaches
- A scatter search-based heuristic to locate capacitated transshipment points
- A neural model for the \(p\)-median problem
- Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works
- A hybrid heuristic for the \(p\)-median problem
- Matheuristics: survey and synthesis
- An alternating heuristic for medianoid and centroid problems in the plane
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
- The gravity \(p\)-median model
- A Langrangean heuristic for the \(p_ k\)-median dynamic location problem
- A hybrid of the Newton-GMRES and electromagnetic meta-heuristic methods for solving systems of nonlinear equations
- P-median problems with an additional constraint on the assignment variables
- A heuristic for large-size \(p\)-median location problems with application to school location
- A note on solving large p-median problems
- A branch decomposition algorithm for the \(p\)-median problem
- An effective heuristic for the \(P\)-median problem with application to ambulance location
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint
- The directional \(p\)-median problem: definition, complexity, and algorithms
- On the conditional \(p\)-median problem
- A new heuristic approach for the P-median problem
- Approximate solution of the \(p\)-median minimization problem
Uses Software
This page was built for publication: A dynamic programming heuristic for the \(P\)-median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278985)
