1. 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, 1997.
2. , , Efficient heuristics for the Rectilinear distance capacitated multi-facility Weber problem, Research Paper Series No: FBE-IE-03/2005-04, Boğaziçi University, Bebek, İstanbul, 2005.
3. , , Linear Programming and Network Flows, third ed., John Wiley and Sons, 2004.
4. Accelerating convergence in the Fermat–Weber location problem
5. Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances