A unified model for Weber problems with continuous and network distances

Computers and Operations Research

Volumn 35, Issue 2, 2008, Pages 312-326

  Pfeiffer, B ^a   Klamroth, K ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

Barriers; Embedded networks; Mixed distances; Mixed integer bilinear programming; Weber problem

Indexed keywords

MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; TRACKING (POSITION);

EMBEDDED NETWORKS; MIXED DISTANCES; MIXED INTEGER BILINEAR PROGRAMMING; WEBER PROBLEMS;

COMPUTER NETWORKS;

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

References (20)

1. Hamacher H.W., and Nickel S. Restricted planar location problems and applications. Naval Research Logistics 42 (1995) 967-992
2. Sarkar A., Batta R., and Nagi R. Commentary on facility location in the presence of congested regions with the rectilinear distance metric. Socio-Economic Planning Sciences 38 (2004) 291-306
3. Klamroth K. Single-facility location problems with barriers. Springer series in operations research (2002), Springer, Berlin
4. Drezner Z, Hamacher HW, editors. Facility location: applications and theory. New York: Springer; 2002
5. Batta R., and Palekar U.S. Mixed planar/network facility location problems. Computers and Operations Research 15 1 (1988) 61-67
6. Erkut E. A mixed-norm location problem for an undesirable facility. Technical Report No. 92-1, University of Alberta, Edmonton, Canada; 1992.
7. Blanquero R., Carrizosa E., and Infante R. Locating a facility outside the transportation network, localization results. Studies in Locational Analysis 14 (2000) 1-21
8. Berman O., Drezner Z., and Wesolowsky G.O. Routing and location on a network with hazardous threats. Journal of the Operational Research Society 51 (2000) 1093-1099
9. Drezner Z., and Wesolowsky G.O. Obnoxious facility location in the interior of a planar network. Journal of Regional Science 35 4 (1996) 675-688
10. Carrizosa E., and Rodriguez-Chia A.M. Weber problems with alternative transportation systems. European Journal of Operational Research 97 (1997) 87-93
11. Klamroth K. A reduction result for location problems with polyhedral barriers. European Journal of Operational Research 130 (2001) 486-497
12. Juel H., and Love R.F. Hull properties in location problems. European Journal of Operational Research 12 (1983) 262-265
13. Wendell R.E., and Hurter A.P. Location theory, dominance and convexity. Operations Research 21 (1973) 314-320
14. Ward J.E., and Wendell R.E. Using block norms for location modeling. Operations Research 33 (1985) 1074-1090
15. Pfeiffer B., and Klamroth K. Bilinear programming formulations for Weber problems with continuous and network distances. Journal of the Operations Research Society of Japan 48 (2005) 123-134
16. Sherali H.D., and Adams W.P. Reformulation-linearization techniques for discrete optimization problems. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of combinatorial optimization (1998), Kluwer Academic Publishers, Dordrecht 1-54
17. Chang C.-T., and Chang C.-C. A linearization method for mixed 0-1 polynomial programs. Computers and Operations Research 27 (2000) 1005-1016
18. Fleischmann T. The uncapacitated multifacility location-allocation problem with barriers. Diplomarbeit, Institute of Applied Mathematics, University Erlangen-Nuremberg, Germany; 2004.
19. Plastria F. GBSSS, the Generalized Big Square Small Square method for planar single facility location. European Journal of Operational Research 62 (1992) 163-174
20. Bischoff M, Klamroth K. An efficient solution method for Weber problems with barriers based on genetic algorithms. European Journal of Operational Research, 2005, accepted for publication.