论文信息 - A note on the location of an obnoxious facility on a network

A note on the location of an obnoxious facility on a network

Abstract We find the best location for an obnoxious facility on a network such that the least weighted distance to all nodes of the network is maximized.

Zvi Drezner | Oded Berman | Z. Drezner | O. Berman

[1] Averill M. Law,et al. The art and theory of dynamic programming , 1977 .

[2] N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[3] Emanuel Melachrinoudis,et al. Locating an obnoxious facility within a polygonal region , 1986 .

[4] Zvi Drezner,et al. Location of Multiple Obnoxious Facilities , 1985, Transp. Sci..

[5] Michael Ian Shamos,et al. Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[6] R. Garfinkel,et al. Locating an Obnoxious Facility on a Network , 1978 .

[7] John N. Hooker,et al. Finite Dominating Sets for Network Location Problems , 1991, Oper. Res..

[8] Erhan Erkut,et al. Analytical models for locating undesirable facilities , 1989 .

[9] Nimrod Megiddo,et al. Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[10] Zvi Drezner,et al. THE LOCATION OF AN OBNOXIOUS FACILITY WITH RECTANGULAR DISTANCES , 1983 .