×

zbMATH — the first resource for mathematics

A linear programming solution to the generalized rectangular distance Weber problem. (English) Zbl 0305.90063

MSC:
90C90 Applications of mathematical programming
90C05 Linear programming
05A05 Permutations, words, matrices
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Bindschedler, J. Industrial Engineering 12 pp 41– (1961)
[2] Cabot, AIIE Transactions 12 pp 132– (1970) · doi:10.1080/05695557008974743
[3] Fitzsimmons, Management Science 79 pp 627– (1973)
[4] Francis, J. Industrial Engineering 14 pp 57– (1963)
[5] Francis, Operations Research 22 pp 400– (1974)
[6] and , ”A Numerically Stable Form of the Simplex Algorithm,” Maths. Rep. No. 87, National Physics Laboratory (Aug. 1970).
[7] Love, Nav. Res. Log. Quart 22 (1975)
[8] Pritsker, AIIE Transactions 12 pp 290– (1970) · doi:10.1080/05695557008974767
[9] Wagner, Nav. Res. Log. Quart. 5 pp 257– (1958)
[10] Wendell, Operations Research 21 pp 314– (1973)
[11] Wesolowsky, Operations Research 19 pp 124– (1971)
[12] Wesolowsky, Management Science 18 pp 656– (1972)
[13] Wesolowsky, Geographical Analysis 5 pp 95– (1973)
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.