Corpus ID: 13703296

Chapter 2 The p-Median Problem

@inproceedings{Daskin2017Chapter2T,
  title={Chapter 2 The p-Median Problem},
  author={Mark S. Daskin and Kayse Lee Maass},
  year={2017}
}
The p-median problem is central to much of discrete location modeling and theory. While the p-median problem is NP-hard on a general graph, it can be solved in polynomial time on a tree. A linear time algorithm for the 1-median problem on a tree is described. We also present a classical formulation of the problem. Basic construction and improvement algorithms are outlined. Results from the literature using various metaheuristics including tabu search, heuristic concentration, genetic algorithms… Expand
1 Citations

References

SHOWING 1-10 OF 32 REFERENCES
The p-median problem: A survey of metaheuristic approaches
  • 353
  • PDF
BEAMR: An exact and approximate model for the p-median problem
  • R. Church
  • Mathematics, Computer Science
  • Comput. Oper. Res.
  • 2008
  • 42
An Algorithmic Approach to Network Location Problems. II: The p-Medians
  • 1,197
  • Highly Influential
An efficient tabu search procedure for the p-Median Problem
  • 241
A statistical analysis of simulated annealing applied to the p-median problem
  • 84
Heuristic concentration and Tabu search: A head to head comparison
  • 66
The Lagrangian Relaxation Method for Solving Integer Programming Problems
  • M. Fisher
  • Mathematics, Computer Science
  • Manag. Sci.
  • 2004
  • 1,626
  • PDF
An Efficient Genetic Algorithm for the p-Median Problem
  • 322
  • Highly Influential
Variable neighborhood search for the p-median
  • 393
Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
  • 755
...
1
2
3
4
...