M. Bischoff, T. Fleischmann and K. Klamroth, ''The Mul-ti-Facility Location-Allocation Problem with Polyhedral Barriers'', Computers and Operations Research, 36, 2009, pp.1376–1392. doi: 10.1016/j.cor.2008.02.014

has been cited by the following article:

• TITLE: Random Search Algorithm for the Generalized Weber Problem

  AUTHORS: Lev Kazakovtsev

  KEYWORDS: Discrete Optimization; Weber Problem; Random Search; Genetic Algorithms; Parallel Algorithm

  JOURNAL NAME: Journal of Software Engineering and Applications, Vol.5 No.12B, January 18, 2013

  ABSTRACT: In this paper, we consider the planar multi-facility Weber problem with restricted zones and non-Euclidean distances, propose an algorithm based on the probability changing method (special kind of genetic algorithms) and prove its efficiency for approximate solving this problem by replacing the continuous coordinate values by discrete ones. Version of the algorithm for multiprocessor systems is proposed. Experimental results for a high-performance cluster are given.