Jacobsen, Soren Kruse An algorithm for the minimax Weber problem. (English) Zbl 0452.90024 Eur. J. Oper. Res. 6, 144-148 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 7 Documents MSC: 90B05 Inventory, storage, reservoirs 65K05 Numerical mathematical programming methods Keywords:minimax Weber problem; logistics; minimax location; weighted absolute center; Euclidean plane; algorithm; implementation; method of feasible directions; proof of convergence; computational experience; FORTRAN × Cite Format Result Cite Review PDF Full Text: DOI References: [1] Charalambous, C.; Conn, A. R., An efficient method to solve the minimax problem directly, SIAM J. Numer. Anal., 15, 1, 162-187 (1978) · Zbl 0384.65032 [2] Eilon, S.; Watson-Gandy, C. D.T.; Christofides, N., Distribution Management: Mathematical Modelling and Practical Analysis (1971), Charles Griffin and Co. Ltd.,: Charles Griffin and Co. Ltd., London [3] Elzinga, J.; Hearn, D. W., Geometrical solutions for some minimax location problems, Transportation Sci., 6, 4, 379-394 (1972) [4] Elzinga, J.; Hearn, D. W.; Randolph, W. D., Minimax multifacility location with Euclidean distances, Transportation Sci., 10, 4, 321-336 (1976) [5] Handler, G. Y.; Mirchandani, P. B., Location on Networks: Theory and Algorithms (1979), MIT-Press: MIT-Press Cambridge, MA · Zbl 0533.90026 [6] Luenberger, D. G., Introduction to Linear and Nonlinear Programming (1973), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0241.90052 [7] Späth, H., Computational experiences with the exchange method, European J. Operational Res., 1, 1, 23-31 (1977) · Zbl 0353.65004 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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.