1. Probabilistic formulations of the multi-facility Weber problem;Aly;Naval Research Logistics Quarterly,1978
2. Al-Loughani, I., 1997. Algorithmic approaches for solving the Euclidean distance location–allocation problems. Ph.D. Dissertation, Industrial and System Engineering, Virginia Polytechnic Institute and State University, Blacksburgh, Virginia.
3. Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem;Aras;Journal of the Operational Society,2007
4. Accelerating convergence in the Fermat–Weber location problem;Brimberg;Operations Research Letters,1998
5. Improvements and comparison of heuristics for solving the uncapacitated multi-source Weber problem;Brimberg;Operations Research,2000