Heuristic methods for thep-center problem
Author:
- Blas PelegrinBPBlas Pelegrin
Open Access
- 1 January 1991
- journal article
- research article
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 25 (1) , 65-72
Abstract
RO : RAIRO - Operations Research, an international journal on operations research, exploring high level pure and applied aspectsKeywords
This publication has 22 references indexed in Scilit:
- A note on the m-center problem with rectilinear distancesEuropean Journal of Operational Research, 1988
- On the rectangularp-center problemNaval Research Logistics (NRL), 1987
- A Note on p -Center Problems in the PlaneTransportation Science, 1986
- A simple heuristic for the p-centre problemOperations Research Letters, 1985
- The p-Centre Problem—Heuristic and Optimal AlgorithmsJournal of the Operational Research Society, 1984
- Technical Note—Extension of the Elzinga-Hearn Algorithm to the Weighted CaseOperations Research, 1982
- Single Facility $l_p $-Distance Minimax LocationSIAM Journal on Algebraic Discrete Methods, 1980
- A Minimax Location Problem on a NetworkTransportation Science, 1974
- N‐DIMENSIONAL LOCATION MODELS: AN APPLICATION TO CLUSTER ANALYSISJournal of Regional Science, 1973
- Heuristic Methods for Location-Allocation ProblemsSIAM Review, 1964