A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks

Computers and Operations Research

Volumn 32, Issue 2, 2005, Pages 309-325

  Colebrook, M ^a   Gutierrez J ^a   Sicilia, J ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Maxian problem; Network location; Undesirable (noxious obnoxious) facility

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GEOGRAPHIC INFORMATION SYSTEMS; LINEAR SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

MAXIAN PROBLEM; NETWORK LOCATION; PLANAR NETWORKS; UNDESIRABLE FACILITIES;

OPERATIONS RESEARCH;

EID: 4544302238     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(03)00238-7     Document Type: Article

References (15)

1. Hakimi S.L. Optimum locations on switching centers and the absolute centers and medians of a graph. Operations Research. 12(3):1964;450-459.
2. Church R.L., Garfinkel R.S. Locating an obnoxious facility on a network. Transportation Science. 12(2):1978;107-118.
3. Minieka E. Anticenters and antimedians of a network. Networks. 13(3):1983;359-364.
4. Ting S.S. A linear-time algorithm for maxisum facility location on tree networks. Transportation Science. 18(1):1984;76-84.
5. Tamir A. Improved complexity bounds for center location problems on networks by using dynamic data structures. SIAM Journal on Discrete Mathematics. 1(3):1988;377-396.
6. 3 and related problems SIAM Journal on Computing. 12(4):1982;759-776.
7. Dyer M.E. Linear time algorithms for two- and three-variable linear programs. SIAM Journal on Computing. 13(1):1984;31-45.
8. Melachrinoudis E.M., Zhang F.G. An. O(mn) algorithm for the 1-maximin problem on a network Computers and Operations Research. 26(9):1999;849-869.
9. Berman O., Drezner Z. A note on the location of an obnoxious facility on a network. European Journal of Operational Research. 120(1):2000;215-217.
10. Colebrook M., Gutiérrez J., Alonso S., Sicilia J. A new algorithm for the undesirable 1-center problem on networks. Journal of the Operational Research Society. 53(12):2002;1357-1366.
11. Erkut E., Neuman S. Analytical models for locating undesirable facilities. European Journal of Operational Research. 40(3):1989;275-291.
12. Tamir A. Obnoxious facility location on graphs. SIAM Journal on Discrete Mathematics. 4(4):1991;500-567.
13. Zemel E. An. O(n) algorithm for the linear multiple choice knapsack problem and related problems Information Processing Letters. 18(3):1984;123-128.
14. Hoare C.A.R. Algorithm 63. partition. Algorithm 65: find Communications of the ACM. 4(7):1961;321-322.
15. Melhorn K, Näher S. The LEDA platform of combinatorial and geometric computing. Cambridge: Cambridge University Press; 1999 ( http://www.mpi-sb.mpg. de/LEDA/ ).