Technical Note—Solving Constrained Multi-Facility Location Problems Involving lp Distances Using Convex Programming
Published Online:1 Jun 1975https://doi.org/10.1287/opre.23.3.581
- Cited by
- 28 November 2023 | International Journal of Production Research, Vol. 62, No. 1-2
- 22 January 2018 | Mathematical Methods of Operations Research, Vol. 88, No. 1
- Computers & Mathematics with Applications, Vol. 44, No. 1-2
- 15 April 2002 | Naval Research Logistics (NRL), Vol. 49, No. 4
- IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, Vol. 48, No. 8
- Computers & Mathematics with Applications, Vol. 40, No. 4-5
- Journal of Manufacturing Systems, Vol. 13, No. 4
- Annals of Operations Research, Vol. 40, No. 1
- Annals of Operations Research, Vol. 18, No. 1
- 29 March 2011 | RAIRO - Operations Research, Vol. 22, No. 4
- Computers & Operations Research, Vol. 14, No. 5
- 21 November 2006 | Naval Research Logistics Quarterly, Vol. 33, No. 3
- 21 November 2006 | Naval Research Logistics Quarterly, Vol. 32, No. 3
- Computers & Operations Research, Vol. 8, No. 1
- International Journal of Physical Distribution & Materials Management, Vol. 11, No. 1
- 17 August 2007 | Annals of Public and Cooperative Economics, Vol. 51, No. 1-2
- Journal of Mathematical Psychology, Vol. 14, No. 3
- 21 November 2006 | Naval Research Logistics Quarterly, Vol. 22, No. 3
- Zeitschrift für Operations Research, Vol. 19, No. 2
Volume 23, Issue 3
May-June 1975
Pages 389-601
Article Information
Metrics
Information
- Published Online:June 01, 1975
© 1975 INFORMS
Cite as
Robert F. Love, James G. Morris, (1975) Technical Note—Solving Constrained Multi-Facility Location Problems Involving lp Distances Using Convex Programming. Operations Research 23(3):581-587.
https://doi.org/10.1287/opre.23.3.581
