A branch and bound algorithm for determining locations of long-term care facilities
European Journal of Operational Research
Kim, D.-G. K., Yeong-Dae. (2010). A branch and bound algorithm for determining locations of long-term care facilities. [Journal Article]. European Journal of Operational Research, 206(1), 168-177.
This paper focuses on the problem of determining locations for long-term care facilities with the objective of balancing the numbers of patients assigned to the facilities. We present a branch and bound algorithm by developing dominance properties, a lower bounding scheme and a heuristic algorithm for obtaining an upper bound for the problem. For evaluation of the suggested branch and bound algorithm, computational experiments are performed on a number of test problems. Results of the experiments show that the suggested algorithm gives optimal solutions of problems of practical sizes in a reasonable amount of computation time.