References
- Albareda-Sambola, M., L. I. Mart´ınez-merino, and A. M. Rodr´ıguez-ch´ıa. 2019. “The Stratified P-center Problem.” Computers and Operation Research 108: 213–225. doi:https://doi.org/10.1016/j.cor.2019.04.013.
- Alizadeh, B., and R. E. Burkard. 2011. “Uniform-cost Inverse Absolute and Vertex Center Location Problems with Edge Length Variations on Trees.” Discrete Applied Mathematics 159 (8): 706–716. doi:https://doi.org/10.1016/j.dam.2011.01.009.
- Al-khedhairi, A., and S. Salhi. 2005. “Enhancement to Two Exact Algorithms for Solving the Vertex P -center Problem.” Journal of Mathematical Modelling and Algorithms 4 (2): 129–147. doi:https://doi.org/10.1007/s10852-004-4072-3.
- Atta, S., P. R. S. Mahapatra, and A. Mukhopadhyay. 2019. “Multi-objective Uncapacitated Facility Location Problem with Customers Preferences: Pareto-based and Weighted Sum GA-based Approaches.” Soft Computing 23: 12347–12362.
- Bai, C., L. Kang, and E. Shan. 2018. “The Connected P -center Problem on Cactus Graphs.” Theoretical Computer Science 749: 59–65. doi:https://doi.org/10.1016/j.tcs.2017.09.028.
- Bashiri, M., M. Mirzaei, and M. Randall. 2013. “Modeling Fuzzy Capacitated P -hub Center Problem and a Genetic Algorithm Solution.” Applied Mathematical Modelling 37 (5): 3513–3525. doi:https://doi.org/10.1016/j.apm.2012.07.018.
- Bespamyatnikh, D., B. Bhattacharya, M. Keil, D. Kirkpatrick, and M. Segal. 2000. “Efficient Algorithms for Centers and Medians in Interval and Circular-arc Graphs.” Networks 39 (3): 144–152. doi:https://doi.org/10.1002/net.10023.
- Chandrasekaran, R., and A. Tamir. 1982. “Polynomially Bounded Algorithms for Locating P -centers on a Tree.” Mathematics Programming 22 (1): 304–315. doi:https://doi.org/10.1007/BF01581045.
- Contardo, C., M. Iori, and R. Kramer. 2019. “A Scalable Exact Algorithm for the Vertex P -center Problem.” Computers & Operations Research 103: 211–220. doi:https://doi.org/10.1016/j.cor.2018.11.006.
- Du, B., H. Zhou, and R. Leus. 2020. “A Two-stage Robust Model for A Reliable P-center Facility Location problem.” Applied Mathematical Modelling 77: 99–114. doi:https://doi.org/10.1016/j.apm.2019.07.025.
- Dvir, D., and H. Y. Handler. 2004. “The Absolute Center of a Network.” Networks 43 (2): 109–118. doi:https://doi.org/10.1002/net.10108.
- Erkayman, B., E. Gundogar, G. Akkaya, and M. Ipek. 2011. “A Fuzzy TOPSIS Approach for Logistics Center Location Selection.” Journal of Business Case Studies 7 (3): 49–54.
- Ernst, A. T., H. Hamacher, H. Jiang, M. Krishnamoorthy, and G. Woeginger. 2009. “Uncapacitated Single and Multiple Allocation P -hub Center Problems.” Computers & Operations Research 36 (7): 2230–2241. doi:https://doi.org/10.1016/j.cor.2008.08.021.
- Fathali, J., and A. Jamalian. 2012. “Locating Multiple Facilities in Convex Sets with Fuzzy Data and Block Norms.” Applied Mathematics 3 (12): 1950–1958. doi:https://doi.org/10.4236/am.2012.312267.
- Gao, Y., and Z. Qin. 2016. “A Chance Constrained Programming Approach for Uncertain P-hub Center Location Problem.” Computers & Industrial Engineering 102: 10–20. doi:https://doi.org/10.1016/j.cie.2016.09.017.
- Ghezavati, V., and P. Hosseinifar. 2018. “Application of Efficient Metaheuristics to Solve a New Bi-objective Optimization Model for Hub Facility Location Problem considering Value at Risk Criterion.” Soft Computing 22 (1): 195–212. doi:https://doi.org/10.1007/s00500-016-2326-4.
- Handler, H. Y., and P. B. Mirchandani. 1979. Location on Networks: Theory and Algorithms. Cambridge, MA: MIT Press.
- Kariv, O., and S. L. Hakimi. 1979. “An Algorithmic Approach to Network Location Problems. I: The P -centers.” SIAM Journal on Applied Mathematics 37 (3): 513–538. doi:https://doi.org/10.1137/0137040.
- Khalili Goodarzi, F., N. A. Taghinezhad, and S. H. Nasseri. 2014. “A New Fuzzy Approach to Solve A Novel Model of Open Shop Scheduling Problem.” University Politehnica of Bucharest, Scientific Bulletin-Series A-Applied Mathematics and Physics 76 (3): 199–210.
- Lu, C. C. 2013. “Robust Weighted Vertex P-center Model considering Uncertain Data: An Application to Emergency Management.” European Journal of Operational Research 230 (1): 113–121. doi:https://doi.org/10.1016/j.ejor.2013.03.028.
- Megiddo, N. 1983. “Linear-time Algorithms for Linear Programming in R3 and Related Problems.” SIAM Journal on Computing 12 (4): 759–776. doi:https://doi.org/10.1137/0212052.
- Minieka, E. 1981. “A Polynomial Time Algorithm for Finding the Absolute Center of A Network.” Networks 11 (4): 351–355. doi:https://doi.org/10.1002/net.3230110404.
- Mirchandani, P. B., and P. L. Francis. 1990. Discrete Location Theory. New York: Wiley.
- Mledanovic, N., M. Labbe, and P. Hansen. 2003. “Solving the P -center Problem with Tabu Search and Variable Neighborhood Search.” Networks 42 (1): 48–64. doi:https://doi.org/10.1002/net.10081.
- Nasseri, S. H., F. Khalili, N. Taghi-Nezhad, and S. Mortezania. 2014. “A Novel Approach for Solving Fully Fuzzy Linear Programming Problems Using Membership Function Concepts.” Annals of Fuzzy Mathematics and Informatics 7 (3): 355–368.
- Nasseri, S. H., N. Taghi-Nezhad, and A. Ebrahimnejad. 2017a. “A Note on Ranking Fuzzy Numbers with an Area Method Using Circumcenter of Centroids.” Fuzzy Information and Engineering 9 (2): 259–268. doi:https://doi.org/10.1016/j.fiae.2017.06.009.
- Nasseri, S. H., N. A. Taghi-Nezhad, and A. Ebrahimnejad. 2017b. “A Novel Method for Ranking Fuzzy Quantities Using Center of Incircle and Its Application to A Petroleum Distribution Center Evaluation Problem.” International Journal of Industrial and Systems Engineering 27 (4): 457–484. doi:https://doi.org/10.1504/IJISE.2017.087832.
- Nayeem, S. M. A., and M. Pal. 2005. “Genetic Algorithm to Solve the P-centre and P-radius Problem on a Network.” International Journal of Computer Mathematics 82 (5): 541–550. doi:https://doi.org/10.1080/00207160512331323380.
- Nayeem, S. M. A., and M. Pal. 2008. “The P -center Problem on Fuzzy Networks and Reduction Cost.” Iranian Journal of Fuzzy Systems 5 (1): 1–26.
- Ozsoya, F. A., and M. C. Pinar. 2006. “An Exact Algorithm for the Capacitated Vertex P -center Problem.” Computers & Operations Research 33 (5): 1420–1436. doi:https://doi.org/10.1016/j.cor.2004.09.035.
- Peng, X., X. Xia, R. Zhu, L. Lin, H. Gao, and P. He. 2018. “A Comparative Performance Analysis of Evolutionar on K-median and Facility Location Problems.” Soft Computing 22 (23): 7787–7796.
- Quevedo-Orozco, D. R., and R. Z. Ríosmercado. 2015. “Improving the Quality of Heuristic Solutions for the Capacitated Vertex P -center Problem through Iterated Greedy Local Search with Variable Neighborhood Descent.” Computers and Operation Research 62: 133–144. doi:https://doi.org/10.1016/j.cor.2014.12.013.
- Taghi-Nezhad, N. A. 2019. “The P-median Problem in Fuzzy Environment: Proving Fuzzy Vertex Optimality Theorem and Its Application.” Soft Computing 23: 11399–11407.
- Taleshian, F., and J. Fathali. 2016. “A Mathematical Model for Fuzzy p-Median Problem with Fuzzy Weights and Variables.” Advances in Operations Research 2016: 1–13. doi:https://doi.org/10.1155/2016/7590492.
- Taleshian, F., J. Fathali, and N. A. Taghi-Nezhad. 2018. “Fuzzy Majority Algorithms for the 1-median and 2-median Problems on a Fuzzy Tree.” Fuzzy Information and Engineering 10 (2): 225–248. doi:https://doi.org/10.1080/16168658.2018.1517976.
- Wang, B., H. Xiong, and C. Jiang. 2014. “A Multicriteria Decision Making Approach Based on Fuzzy Theory and Credibility Mechanism for Logistics Center Location Selection.” The Scientific World Journal 2014: 1–9. doi:https://doi.org/10.1155/2014/347619.
- Wang, S., and P. Liu (2007), “The Evaluation Study on Location Selection of Logistics Center Based on Fuzzy AHP and TOPSIS.” In 2007 International conference on wireless communications, networking and mobile computing, Honolulu Hawaii USA, 3779–3782. IEEE.
- Yaman, H., and S. Elloumi. 2012. “Star P -hub Center Problem and Star P-hub Median Problem with Bounded Path Lengths.” Computers & Operations Research 39 (11): 2725–2732. doi:https://doi.org/10.1016/j.cor.2012.02.005.
- Yang, K., Y. K. Liu, and G. Q. Yang. 2013. “Solving Fuzzy P -hub Center Problem by Genetic Algorithm Incorporating Local Search.” Applied Soft Computing 13 (5): 2624–2632. doi:https://doi.org/10.1016/j.asoc.2012.11.024.