Page 39 - 33-3
P. 39

NTU Management Review Vol. 33 No. 3 Dec. 2023




               Drezner, T., Drezner, Z., and Zerom, D. 2018. Competitive facility location with random
                        attractiveness. Operations Research Letters, 46 (3): 312-317.
               Edmonds, J., and Karp, R. M. 1972. Theoretical improvements in algorithmic efficiency
                        for network flow problems. Journal of the ACM (JACM), 19 (2): 248-264.

               Espejo, I., Marín, A., and Rodríguez-Chía, A. M. 2012. Closest assignment constraints in
                        discrete location problems. European Journal of Operational Research, 219 (1):
                        49-58.
               Filippi, C., Guastaroba, G., and Speranza, M. G. 2021. On single-source capacitated
                        facility location with cost and fairness objectives. European Journal of

                        Operational Research, 289 (3): 959-974.
               Gadegaard, S. L., Klose, A., and Nielsen, L. R. 2018. An improved cut-and-solve
                        algorithm for the single-source capacitated facility location problem. EURO
                        Journal on Computational Optimization, 6 (1): 1-27.
               Hanjoul, P., and Petters, D. 1987. A facility location problem with clients’ preference
                        orderings. Regional Science and Urban Economics, 17 (3): 451-473.

               Hansen, P., Kochetov, Y., and Mladenovi, N. 2004. Lower bounds for the uncapacitated
                        facility location problem with user preferences. In Eremeev, V. (Eds.),
                        Proceedings of 2nd International Workshop Discrete Optimization Methods in
                        Production and Logistics: 50-55. Montreal, Canada: GREAD-HEC.
               Harkness, J., and ReVelle, C. 2003. Facility location with increasing production costs.

                        European Journal of Operational Research, 145 (1): 1-13.
               Hiassat, A. 2017. Resource allocation models in healthcare decision making. Unpublished
                        doctoral dissertation, University of Waterloo, Waterloo, Canada.
               Ho, S. C. 2015. An iterated tabu search heuristic for the single source capacitated facility
                        location problem. Applied Soft Computing, 27: 169-178.

               Hosseini, M. B., Dehghanian, F., and Salari, M. 2019. Selective capacitated location-
                        routing problem with incentive-dependent returns in designing used products
                        collection network. European Journal of Operational Research, 272 (2): 655-
                        673.
               Kang, C. N., Kung L. C., Chiang P. H., and Yu, J. Y. 2023. A service facility location

                        problem considering customer preference and facility capacity. Computers
                        & Industrial Engineering, 177, Article 109070. https://doi.org/10.1016/
                        j.cie.2023.109070


                                                     31
   34   35   36   37   38   39   40   41   42   43   44