Heuristic and Special Case Algorithms for Dispersion Problems
暂无分享,去创建一个
[1] R. Garfinkel,et al. Locating an Obnoxious Facility on a Network , 1978 .
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Ellis Horowitz,et al. Fundamentals of Computer Algorithms , 1978 .
[4] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .
[5] Pitu B. Mirchandani,et al. Location on networks : theory and algorithms , 1979 .
[6] Lee J. White,et al. A Maxmin Location Problem , 1980, Oper. Res..
[7] R. Chandrasekaran,et al. Location on Tree Networks: P-Centre and n-Dispersion Problems , 1981, Math. Oper. Res..
[8] Fred S. Roberts,et al. Applied Combinatorics , 1984 .
[9] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[10] E. Melachrinoudis,et al. Locating an undesirable facility with a minimax criterion , 1986 .
[11] D. W. Wang,et al. A Study on Two Geometric Location Problems , 1988, Information Processing Letters.
[12] Erhan Erkut,et al. Analytical models for locating undesirable facilities , 1989 .
[13] E. Erkut. The discrete p-dispersion problem , 1990 .
[14] Erhan Erkut,et al. The discrete p-Maxian location problem , 1990, Comput. Oper. Res..
[15] Douglas J. White. The maximal dispersion problem and the "First point outside the neighbourhood" heuristic , 1991, Comput. Oper. Res..
[16] E. Erkut,et al. Comparison Of Four Models For dispersing Facilities , 1991 .
[17] D. White. The maximal-dispersion problem , 1991 .
[18] Arie Tamir,et al. Obnoxious Facility Location on Graphs , 1991, SIAM J. Discret. Math..
[19] E. Erkut,et al. A Parametric 1-Maximin Location Problem , 1991 .
[20] Pierre Hansen,et al. Dispersing Facilities on a Network , 1995 .