1. Density based problem space search for the capacitated clustering p-median problem;Ahmadi;Ann. Oper. Res.,2004
2. Greedy random adaptive memory programming search for the capacitated clustering problem;Ahmadi;European J. Oper. Res.,2005
3. Arthur, D., Vassilvitskii, S., 2007. k-means++: The advantages of careful seeding. In: Gabow, H. (Ed.), Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, Pennsylvania USA, pp. 1027–1035.
4. An aggregation heuristic for large scale p-median problem;Avella;Comput. Oper. Res.,2012
5. Bachem, O., Lucic, M., Hassani, S.H., Krause, A., 2016. Approximate k-means++ in sublinear time. In: Schuurmans, D., Wellman, M. (Ed.), Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, Arizona USA, pp. 1459–1467.