×

zbMATH — the first resource for mathematics

An algorithm for the solution of a location problem with metric constraints. (English) Zbl 0298.90063

MSC:
90C99 Mathematical programming
90C30 Nonlinear programming
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Cooper, Operations Research 2 (1963)
[2] Francis, Nav. Res. Log. Quart. 19 pp 335– (1972)
[3] Hogg, Operational Research Quarterly 19 (1968)
[4] Hurter, Management Science.
[5] Hurter, SIAM J. of Control
[6] ”Location Problems and Mathematical Programming,” in Special 1963 Colloquium on the Application of Mathematics to Economics (Budapest, Publishing House of the Hungarian Academy of Sciences, 1965) pp. 235–242.
[7] Kuhn, J. of Regional Science 4 (1962)
[8] Love, Nav. Res. Log. Quart. 16 pp 503– (1969) · Zbl 0194.20805 · doi:10.1002/nav.3800160405
[9] Nonlinear Programming, (McGraw-Hill Publishing Company, New York, 1969).
[10] Planchart, SIAM Journal of Control.
[11] ”A Geometric Programming Approach to the Problem of Finding Efficient Algorithms for Constrained Location Problems with Mixed Norms,” N.U. Ph. D. Dissertation, June 1973.
[12] Toregas, Operations Research 19 (1971)
[13] and , ”Optimal Location under Time or Distance Constraints,” Papers of the Regional Science Association, Vol 28.
[14] Wendell, Operations Research 21 pp 314– (1973)
[15] and , ”Location of Facilities with Rectangular Distances among Point and Area Destinations,” Nav. Res. Log. Quart., March 1971.
[16] ”Optimal Location of a Central Facility: Mathematical Models and Concepts,” National Bureau of Standards Report 8388, June 1965.
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.