Approximation algorithms for facility location problems (extended abstract)

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	K. Aardal, M. Labbt, J. Leung, and M. Queyranne. On the two-level uncapacitated facility location problem. INFORMS J. Comput., 8:289--301, 1996.
	2	M. L. Balinksi. On finding integer solutions to linear programs. In Proceedings of the IBM Scientific Computing Symposium on Combinatorial Problems, pages 225-248. IBM, 1966.
	3	Judit Bar-Ilan , Guy Kortsarz , David Peleg, How to allocate network centers, Journal of Algorithms, v.15 n.3, p.385-415, Nov. 1993 [doi>10.1006/jagm.1993.1047]
	4	C. Chekuri , R. Motwani , B. Natarajan , C. Stien, Approximation techniques for average completion time scheduling, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.609-618, January 05-07, 1997, New Orleans, Louisiana, United States
	5	G. Cornutjols, M. L. Fisher, and G. L. Nemhauser. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Sci., 8:789-810, 1977.
	6	G. Comutjols, G. L. Nemhauser, and L. A. Wolsey. The uncapacitated facility location problem, in P. Mirchandani and R. Francis, editors, Discrete Location Theory, pages 119- 171. John Wiley and Sons, Inc., New York, 1990.
	7	M. E. Dyer and A. M. Frieze. A s~mple heuristic for the p-center problem. Oper Res. Lett., 3:285-288, 1985.
	8	M. X. Goemans. Personal communication. 1996.
	9	Michel X. Goemans, Improved approximation algorthims for scheduling with release dates, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.591-598, January 05-07, 1997, New Orleans, Louisiana, United States
	10	Leslie A. Hall , Andreas S. Schulz , David B. Shmoys , Joel Wein, Scheduling to minimize average completion time: off-line and on-line approximation algorithms, Mathematics of Operations Research, v.22 n.3, p.513-544, Aug. 1997 [doi>10.1287/moor.22.3.513]
	11	Leslie A. Hall , David B. Shmoys , Joel Wein, Scheduling to minimize average completion time: off-line and on-line algorithms, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.142-151, January 28-30, 1996, Atlanta, Georgia, United States
	12	D.S. Hochbaum. Heuristics for the fixed cost median problem. Math. Programming, 22:148--162, 1982.
	13	D. S. Hochbaum and D. B. Shmoys. A best possible approximation algorithm for the k-center problem. Math. Oper. Res., 10:180-184, 1985.
	14	L. Kaufman, M. vanden Eede, and P. Hansen. A plant and warehouse location problem. Operational Research Quarterly, 28:547-557, 1977.
	15	Samir Khuller , Yoram J. Sussmann, The Capacitated K-Center Problem (Extended Abstract), Proceedings of the Fourth Annual European Symposium on Algorithms, p.152-166, September 25-27, 1996
	16	A. A. Kuehn and M. J. Hamburger. A heuristic program for locating warehouses. Management Sci., 9:643--666, 1963.
	17	E. L. Lawler. Combinatorial Opamization: Networks and Matroids. Holt, Rinehart, and Winston, New York, 1976.
	18	Jyh-Han Lin , Jeffrey Scott Vitter, Approximation algorithms for geometric median problems, Information Processing Letters, v.44 n.5, p.245-249, Dec. 21, 1992 [doi>10.1016/0020-0190(92)90208-D]
	19	Jyh-Han Lin , Jeffrey Scott Vitter, e-approximations with minimum packing constraint violation (extended abstract), Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.771-782, May 04-06, 1992, Victoria, British Columbia, Canada [doi>10.1145/129712.129787]
	20	A. S. Manne. Plant location under economies-of-scaledecentralization and computation. Management Sci., 11:213- 235, 1964.
	21	P. B. Mirchandani and R. L. Francis, eds. Discrete Location Theory. John Wiley and Sons, Inc., New York, 1990.
	22	George L. Nemhauser , Laurence A. Wolsey, Integer and combinatorial optimization, Wiley-Interscience, New York, NY, 1988
	23	A. S. Schulz and M. Skutella. Randomization strikes in LP- based scheduling: Improved approximations for min-sum criteria. Technical Report 533/1996, Department of Mathematics, Technical University of Berlin, 1996.
	24	David B. Shmoys , Éva Tardos, An approximation algorithm for the generalized assignment problem, Mathematical Programming: Series A and B, v.62 n.3, p.461-474, Dec. 8, 1993 [doi>10.1007/BF01585178]
	25	J. F. Stollsteimer. The effect of technical change and output expansion on the optimum number, size and location of pear marketing facilities in a California pear producing region. PhD thesis, University of California at Berkeley, Berkeley, California, 1961.
	26	J. E Stollsteimer. A working model for plant numbers and locations. J. Farm Econom., 45:631--645, 1963.
	27	D. Tcha and B. Lee. A branch-and-bound algorithm for the multi-level uncapacitated location problem. EuropeanJ. Oper. Res., 18:35-43, 1984.
	28	T. J. Van Roy and D. Erlenkotter. A dual based procedure for dynamic facility location. Management Sci., 28:1091-1105, 1982.