论文信息 - Two Classes of Distance Minimization Problems: A Review, Some New Interpretations, and Extensions - 字舞流文

Two Classes of Distance Minimization Problems: A Review, Some New Interpretations, and Extensions

Nurudeen Alao | N. Alao

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

[2] I. Katz. On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems , 1969 .

[3] Leon Cooper,et al. Heuristic Methods for Location-Allocation Problems , 1964 .

[4] Leon Cooper,et al. AN EXTENSION OF THE GENERALIZED WEBER PROBLEM , 1968 .

[5] A. Scott. Location-Allocation Systems: A Review , 2010 .

[6] Christian Werner,et al. Networks of Minimum Length , 1969 .

[7] H. Pollak,et al. Steiner Minimal Trees , 1968 .

[8] William Warntz,et al. Transportation, Social Physics, And The Law Of Refraction , 1957 .

[9] M. Shirosaki. Another proof of the defect relation for moving targets , 1991 .

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

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

[12] K. Eisemann. The Optimum Location of a Center , 1962 .

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

[14] C. Werner,et al. THE LAW OF REFRACTION IN TRANSPORTATION GEOGRAPHY: ITS MULTIVARIATE EXTENSION* , 1968 .