论文信息 - The Single Source Weber Problem — Survey and Extensions

The Single Source Weber Problem — Survey and Extensions

Alfred Weber reduced the problem of locating a firm under the conditions that all cost elements other than those which vary regularly with space are held constant, to that of determining the point(s) of minimum transportation costs. This paper presents a survey of the techniques used to solve this problem and gives an efficient Quadratic Approximation Search Technique which was coded in FORTRAN IV and tested on a number of problems for it.

A. M. El-Shaieb | A. El-Shaieb

[1] John A. White. A Quadratic Facility Location Problem , 1971 .

[2] Douglass J. Wilde,et al. Foundations of Optimization. , 1967 .

[3] W. Miehle. Link-Length Minimization in Networks , 1958 .

[4] R. Bellman. An Application of Dynamic Programming to Location—Allocation Problems , 1965 .

[5] Roger C. Vergin,et al. An Algorithm and Computational Procedure for Locating Economic Facilities , 1967 .

[6] M. Greenhut,et al. Location and Space Economy , 1958 .

[7] Harold W. Kulin,et al. AN EFFICIENT ALGORITHM FOR THE NUMERICAL SOLUTION OF THE GENERALIZED WEBER PROBLEM IN SPATIAL ECONOMICS , 1962 .

[8] Leon Cooper,et al. SOLUTIONS OF GENERALIZED LOCATIONAL EQUILIBRIUM MODELS , 1967 .

[9] L. Cooper. Location-Allocation Problems , 1963 .

[10] R. E. Kalman,et al. Optimum Seeking Methods. , 1964 .

[11] Stuart E. Dreyfus,et al. Applied Dynamic Programming , 1965 .

[12] F. P. Palermo. A network minimization problem , 1961 .

[13] M. Tideman,et al. Comment on A network minimization problem , 1962 .

[14] F. E. Maranzana,et al. On the Location of Supply Points to Minimize Transport Costs , 1964 .