Undesirable facility location problems on multicriteria networks

Computers and Operations Research

Volumn 34, Issue 5, 2007, Pages 1491-1514

  Colebrook, Marcos ^a   Sicilia, Joaquín ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

MEDIAN MODELS; MULTICRITERIA NETWORKS; UNDESIRABLE CENTERS; UNDESIRABLE FACILITY LOCATION PROBLEMS;

COMPUTER NETWORKS;

EID: 33748961788     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.06.010     Document Type: Article

References (21)

1. Erkut E., and Neuman S. Analytical models for locating undesirable facilities. European Journal of Operational Research 40 3 (1989) 275-291
2. Church R.L., and Garfinkel R.S. Locating an obnoxious facility on a network. Transportation Science 12 2 (1978) 107-118
3. Tamir A. Obnoxious facility location on graphs. SIAM Journal on Discrete Mathematics 4 4 (1991) 500-567
4. Minieka E. Anticenters and antimedians of a network. Networks 13 3 (1983) 359-364
5. Ting S.S. A linear-time algorithm for maxisum facility location on tree networks. Transportation Science 18 1 (1984) 76-84
6. Colebrook M, Gutiérrez J, Sicilia J. A new bound and an O (mn) algorithm for the undesirable 1-median problem (maxian) on networks. Computers and Operations Research 2005;32(2):309-25.
7. 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
8. Melachrinoudis E.M., and 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., and 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., and 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. Daskin M.S. Network and discrete location: models, algorithms and applications (1995), Wiley-Interscience, New York
12. Zhang FG. Location on networks with multiple criteria. Dissertation, Northeastern University, Boston, Massachusetts, 1996.
13. Ratick S.J., and White A.L. A risk-sharing model for locating noxious facilities. Environment and Planning B 15 2 (1988) 165-179
14. List G.F., and Mirchandani P.B. An integrated network/planar multiobjective model for routing and siting for hazardous materials and wastes. Transportation Science 25 2 (1991) 146-156
15. Rahman M., and Kuby M. A multiobjective model for locating solid waste transfer facilities using an empirical opposition function. INFOR 33 1 (1995) 34-49
16. Giannikos I. A multiobjective programming model for locating treatment sites and routing hazardous wastes. European Journal of Operational Research 104 2 (1998) 333-342
17. Zhang F.G., and Melachrinoudis E. The maximin-maxisum network location problem. Computational Optimization and Applications 19 2 (2001) 209-234
18. Skriver A.J.V., and Andersen K.A. The bicriterion semi-obnoxious location (BSL) problem solved by an ε{lunate}-approximation. European Journal of Operational Research 146 3 (2001) 517-528
19. Hamacher H.W., Labbé M., Nickel S., and Skriver A.J.V. Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives. Annals of Operations Research 110 1-4 (2002) 33-53
20. Hershberger J. Finding the upper envelope of n line segments in O (n log n) time. Information Processing Letters 33 4 (1989) 169-174
21. Colebrook M. Desirable and undesirable single facility location on networks with multiple criteria. Ph.D. Dissertation, Universidad de La Laguna, Tenerife, Spain, 2003.