论文信息 - Computational Comparison of Two Lagrangian Relaxation for the K-median Problem - 字舞流文

Computational Comparison of Two Lagrangian Relaxation for the K-median Problem

Sang-Hyung Ahn | Sang-Hyung Ahn

[1] J. Krarup,et al. The simple plant location problem: Survey and synthesis , 1983 .

[2] G. Nemhauser,et al. Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[3] Christos H. Papadimitriou,et al. Worst-Case and Probabilistic Analysis of a Geometric Location Problem , 1981, SIAM J. Comput..

[4] George L. Nemhauser,et al. Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[5] Donald Erlenkotter,et al. A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[6] M. Guignard. Fractional vertices, cuts and facets of the simple plant location problem , 1980 .

[7] Alan M. Frieze,et al. Probabilistic Analysis of a Relaxation for the k-Median Problem , 1986, Math. Oper. Res..

[8] M. L. Fisher,et al. Probabilistic Analysis of the Planar k-Median Problem , 1980, Math. Oper. Res..