The discrete p-dispersion problem
- 4 May 1990
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 46 (1) , 48-60
- https://doi.org/10.1016/0377-2217(90)90297-o
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Analytical models for locating undesirable facilitiesPublished by Elsevier ,2011
- Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion ProblemsGeographical Analysis, 1987
- Semi-greedy heuristics: An empirical studyOperations Research Letters, 1987
- Locating independent facilities with maximum weight: Greedy heuristicsOmega, 1986
- Finding a Maximum Clique in an Arbitrary GraphSIAM Journal on Computing, 1986
- Polynomially bounded algorithms for locatingp-centers on a treeMathematical Programming, 1982
- An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a TreeSIAM Journal on Algebraic Discrete Methods, 1980
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979
- Relations between packing and covering numbers of a treePacific Journal of Mathematics, 1975
- The m-Center ProblemSIAM Review, 1970