1. Akyüz, M. H., Öncan, T., & Altınel, İ. K. (2012). Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem. Computers & Operations Research, 39, 225–237.
2. Al-Loughani, L. (1997). Algorithmic approaches for solving the Euclidean distance location-allocation problems. PhD thesis, Virginia Polytechnic Institute and State University, Virginia, USA.
3. Aras, N., Yumuşak, S., & Altınel, İ. K. (2006). Solving the capacitated multi-facility Weber problem by simulated annealing, threshold accepting and genetic algorithms. In K. F. Doerner, M. Gendreau, P. Greistorfer, W. J. Gutjahr, R. F. Hartl & M. Reimann (Eds.), Metaheuristics—progress in complex systems optimization (pp. 91–112). New York: Springer.
4. Aras, N., Altınel, İ. K., & Orbay, M. (2007). New heuristic methods for the capacitated multi-facility Weber problem. Naval Research Logistics, 54, 21–32.
5. Aras, N., Orbay, M., & Altınel, İ. K. (2008). Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem. Journal of the Operations Research Society, 59, 64–79.