A new algorithm for the undesirable 1-center problem on networks

Journal of the Operational Research Society

Volumn 53, Issue 12, 2002, Pages 1357-1366

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

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Location; Networks and graphs; Undesirable (noxious obnoxious) facility

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LINEAR PROGRAMMING; PROBLEM SOLVING;

NETWORK LOCATION ANALYSIS;

OPERATIONS RESEARCH;

EID: 0036902248     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601468     Document Type: Article

References (19)

1. Hakimi S.L. (1964). Optimum locations of switching centers and the absolute centers and medians of a graph. Opns Res 12(3): 450-459.
2. Minieka E. (1981). A polynomial time algorithm for finding the absolute center of a network. Networks 11(4): 351-355.
3. Kariv O. and Hakimi S.L. (1979). An algorithmic approach to network location problems. I: The p-centers. SIAM J Appl Math 37(3): 513-538.
4. Kariv O. and Hakimi S.L. (1979). An algorithmic approach to network location problems. II: The p-medians. SIAM J Appl Math 37(3): 539-560.
5. Erkut E. and Neuman S. (1989). Analytical models for locating undesirable facilities. Eur J Opl Res 40(3): 275-291.
6. Church R.L. and Garfinkel R.S. (1978). Locating an obnoxious facility on a network. Transportation Sci 12(2): 107-118.
7. Tamir A. (1991). Obnoxious facility location on graphs. SIAM J Discrete Math 4(4): 550-567.
8. Minieka E. (1983). Anticenters and antimedians of a network. Networks 13(3): 359-364.
9. Cappanera P. (1999). A survey on obnoxious facility location problems. Technical Report TR-99-11, Dipartimento di Informatica, Università di Pisa.
10. Tamir A. (1988). Improved complexity bounds for center location problems on networks by using dynamic data structures. SIAM J Discrete Math 1(3): 377-396.
11. 3 and related problems. SIAM J Computing 12(4): 759-776.
12. Dyer M.E. (1984). Linear time algorithms for two-and three-variable linear programs. SIAM J Computing 13(1): 31-45.
13. Burkard R.E., Dollani H., Lin Y. and Rote G. (2001). The obnoxious center problem on a tree. SIAM J Discrete Math 14(4): 498-509.
14. Melachrinoudis E. and Zhang F.G. (1999). An O(mn) algorithm for the 1-maximin problem on a network. Comp Opns Res 26(9): 849-869.
15. Berman O. and Drezner Z. (2000). A note on the location of an obnoxious facility on a network. Eur J Opl Res 120(1): 215-217.
16. Hooker J.N., Garfinkel R.S. and Chen C.K. (1991). Finite dominating sets for network location problems. Opns Res 39(1): 100-118.
17. Fredman M.L. and Tarjan R.E. (1987). Fibonacci heaps and their uses in improved network optimization algorithms. J ACM 34(3): 596-615.
18. Melhorn K. and Näher S. (1999). The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press (http://www.mpi-sb.mpg.de/LEDA/).
19. Mixed Integer Linear Program solver (ftp://ftp.es.ele.tue.nl/pub/lp_solve).