A branch and bound algorithm for determining locations of long-term care facilities

Dong-Guen Kim and Yeong-Dae Kim

European Journal of Operational Research, 2010, vol. 206, issue 1, 168-177

Abstract: 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.

Keywords: Facility; location; problem; Long-term; care; facility; Branch; and; bound (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00103-7
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:206:y:2010:i:1:p:168-177

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().