Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach

Full text

Pdf (223 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 6 , Issue 3 (September 1980) table of contents

Pages: 387 - 390

Year of Publication: 1980

ISSN:0098-3500

Author

To-Yat Cheung

Department of Computer Science, University of Ottawa, Ottawa, Ont., Canada K1N 6N5

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 33, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355900.355910 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	CABOT, A.V, FRANCIS, R.L, AND STARY, M A. A network flow solution to a rectilinear distance facility location problem. AIIE Trans. 2 (1970), 132-141
	2	CHEUNG, T.Y. A new mmnnum-cut approach for multlfacfllty location problems with rectilinear distance. Tech Rep. TR78-01, Dep. Comput. Sci., Univ. Ottawa, Ottawa, Ont., Canada.
	3	To-Yat Cheung, Computational Comparison of Eight Methods for the Maximum Network Flow Problem, ACM Transactions on Mathematical Software (TOMS), v.6 n.1, p.1-16, March 1980 [doi>10.1145/355873.355874]
	4	DINIC, E A. Algorithm for solution of a problem of maxnnum flow m a network with power estnnation. Soy Math Dokl 11 (1970), 1277-1280.
	5	EYSTER, J W, WHITE, J.A, AND WIERWILLE, W.W. On solving multffacihty location problems using a hyperbolold approximation procedure. AIIE Trans 5 (1973), 1-6.
	6	NIJENHUIS, A., AND WILF, H S Combinatorial Algorithms. Academic Press, New York, 1975.
	7	PICARD, J.C., AND RATLIFF, H D. A cut approach to the rectilinear distance facility location problem. Oper Res. 26 (1978), 422-433.
	8	PRITSKER, A.A B, AND GHARE, P M. Locating new facilities with respect to existing facflmes AIIE Trans. 2 (1970), 290-297.
	9	RAO, M.R On the direct search approach to the rectilinear facflmes location problem AIIE Trans. 5 (1973), 256-264.
	10	WESOLOWSKY, G.O, AND LOVE, R.F. Nonlinear approximation method for solving a generalized rectangular distance Weber problem. Manage Sc~., 18 (1972), 655-663
	11	WESOLOWSKY, G.O., AND LOVE, R.F. The optimal location of new facilities using rectilinear distances. Oper Res 19 (1971), 124-130