Bagherinejad, J., & Shoeib, M. (2018). Dynamic capacitated maximal covering location problem by considering dynamic capacity. International Journal of Industrial Engineering Computations, 9(2), 249-264. http://dx.doi.org/10.5267/j.ijiec.2017.5.004.
Contardo, C., Iori, M., & Kramer, R. (2019). A scalable exact algorithm for the vertex p-center problem. Computers & Operations Research, 103, 211-220. https://doi.org/10.1016/j.cor.2018.11.006.
Duran-Mateluna, C., Ales, Z., Elloumi, S., & Jorquera-Bravo, N. (2023). Robust MILP formulations for the two-stage weighted vertex p-center problem. Computers & Operations Research, 159, 106334. 0.1016/j.cor.2023.106334.
Nematian, J. (2015). A random fuzzy multi-objective linear programming approach through possibility theory. European Journal of Industrial Engineering, 9(4), 512-537.
Nematian, J., & Sadati, M. (2015). New methods for solving a vertex p-center problem with uncertain demand-weighted distance: A real case study. International Journal of Industrial Engineering Computations, 6(2), 253-266. http://dx.doi.org/10.5267/j.ijiec.2014.10.004.
Nematian, J., & Musavi, M. M. (2016). Uncapacitated hub center problem under uncertainty. Journal of Industrial and Systems Engineering, 9, 23-39. https://www.jise.ir/article_14002.html
Silva, A., Aloise, D., Coelho, L. C., & Rocha, C. (2021). Heuristics for the dynamic facility location problem with modular capacities. European Journal of Operational Research, 290(2), 435-452.