M. S. Canbolat and G. O. Wesolowsky, “The Rectilinear Distance Weber Problem in the Presence of a Probabilistic Line Barrier,” European Journal of Operational Research, Vol. 202, No. 1, 2010, pp. 114-121. doi:10.1016/j.ejor.2009.04.023

has been cited by the following article:

• TITLE: The Capacitated Location-Allocation Problem in the Presence of k Connections

  AUTHORS: Saber Shiripour, Mehdi Amiri-Aref, Iraj Mahdavi

  KEYWORDS: Capacitated Location-Allocation Problem, Line Barrier, Mixed Integer Nonlinear Programming

  JOURNAL NAME: Applied Mathematics, Vol.2 No.8, August 24, 2011

  ABSTRACT: We consider a capacitated location-allocation problem in the presence of k connections on the horizontal line barrier. The objective is to locate a set of new facilities among a set of existing facilities and to allocate an optimal number of existing facilities to each new facility in order to satisfy their demands such that the summation of the weighted rectilinear barrier distances from new facilities to existing facilities is minimized. The proposed problem is designed as a mixed-integer nonlinear programming model. To show the efficiency of the model, a numerical example is provided. It is worth noting that the global optimal solution is obtained.