Drezner, Z.; Wesolowsky, G. O. Single facility \(l_ p-\)distance minimax location. (English) Zbl 0501.90031 SIAM J. Algebraic Discrete Methods 1, 315-321 (1980). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 24 Documents MSC: 90B05 Inventory, storage, reservoirs 65K05 Numerical mathematical programming methods 90C90 Applications of mathematical programming Keywords:minimax location; l-p-distance; facility location on a plane; minimization of maximum; weighted distance; numerical experience; solution algorithm PDF BibTeX XML Cite \textit{Z. Drezner} and \textit{G. O. Wesolowsky}, SIAM J. Algebraic Discrete Methods 1, 315--321 (1980; Zbl 0501.90031) Full Text: DOI References: [1] Danzer, L.; Grunbaum, B.; Klee, V.; Klee, V., Helly’s theorem and its relatives, Proc. Sympos. Pure Math., Vol. VII, 101, (1963), Amer. Math. Soc., Providence, R.I. · Zbl 0132.17401 [2] Minimax location and voroni diagramspresented at joint National ORSA/TIMS MeetingAtlanta1977November [3] Drezner, Z.; Wesolowsky, G. O., A new method for the multifacility minimax location problem, J. Oper. Res. Soc., 29, 1095, (1978) · Zbl 0388.90092 [4] Elzinga, Jack; Hearn, Donald; Randolph, W. D., Minimax multifacility location with Euclidean distances, Transportation Sci., 10, 321, (1976) [5] Francis, R. L.; White, J. A., Facility Layout and Location, (1974) [6] Hakimi, S. L., Optimum locations of switching centers and the absolute centers and medians of a graph, Operations Res., 12, 450, (1964) · Zbl 0123.00305 [7] Minimax network location: theory and algorithmsTechnical Report374Operations Research Center, Massachusetts Institute of TechnologyCambridge, MA1974 [8] The n-center problem: a relaxation approachWorking Paper5816Faculty of Management, Tel-Aviv UniversityIsrael1977January This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.