1. An efficient solution method for Weber problems with barriers based on genetic algorithms;Bischoff;European Journal of Operational Research,2007
2. Bischoff, M., Klamroth, K., 2007. Two branch & bound methods for a generalized class of location–allocation problems. Technical Report No. 313, Institute of Applied Mathematics, University of Erlangen-Nuremberg.
3. A projection method for lp norm location–allocation problems;Bongartz;Mathematical Programming,1994
4. Solving the continuous location–allocation problem with tabu search;Brimberg;Studies in Locational Analysis,1996
5. A variable neighborhood algorithm for solving the continuous location–allocation problem;Brimberg;Studies in Locational Analysis,1996