1. Arthur, D., Vassilvitskii, S., 2007. K-means++ the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 1027–1035.
2. A branch-and-cut method for the obnoxious p-median problem;Belotti;4OR,2007
3. Proximity benders: a decomposition heuristic for stochastic programs;Boland;J. Heuristics,2016
4. Parallel iterative solution-based tabu search for the obnoxious p-median problem;Chang;Comput. Oper. Res.,2021
5. Compact model for the obnoxious p-median problem;Chiang;Am. J. Oper. Res.,2017