Relaxation method for the solution of the minimax location‐allocation problem in euclidean space

R. Chen and G. Y. Handler

Naval Research Logistics (NRL), 1987, vol. 34, issue 6, 775-788

Abstract: A method previously devised for the solution of the p‐center problem on a network has now been extended to solve the analogous minimax location‐allocation problem in continuous space. The essence of the method is that we choose a subset of the n points to be served and consider the circles based on one, two, or three points. Using a set‐covering algorithm we find a set of p such circles which cover the points in the relaxed problem (the one with m

Date: 1987
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198712)34:63.0.CO;2-N

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:34:y:1987:i:6:p:775-788

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().