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

DOI10.1016/j.ejor.2010.02.001zbMath1188.90149OpenAlexW2027230222MaRDI QIDQ976416

Yeong-Dae Kim, Dong-Guen Kim

Publication date: 11 June 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.02.001

zbMATH Keywords

branch and boundfacility location problemlong-term care facility

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85)

Related Items (9)

An integrated approach for planning a long-term care network with uncertainty, strategic policy and equity considerations ⋮ A survey of healthcare facility location ⋮ A Lagrangian heuristic algorithm for a public healthcare facility location problem ⋮ Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations ⋮ The balanced \(p\)-median problem with unitary demand ⋮ Optimal operating strategy for a long-haul liner service route ⋮ Fostering long-term care planning in practice: extending objectives and advancing stochastic treatment within location-allocation modelling ⋮ Service allocation equity in location coverage analytics ⋮ Hybrid metaheuristic method for determining locations for long-term health care facilities

Cites Work

• Unnamed Item
• A genetic algorithm for solving a capacitated \(p\)-median problem
• Designing emergency response networks for hazardous materials transportation
• The gravity \(p\)-median model
• The queueing maximal availability location problem: A model for the siting of emergency vehicles
• Location science research: a review
• A column generation approach to capacitated \(p\)-median problems
• Use of location-allocation models in health service development planning in developing nations
• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
• Location analysis: a synthesis and survey
• Strategic facility location: A review
• Location of preventive health care facilities
• A maximal covering location model in the presence of partial coverage
• The equitable location problem on the plane
• A neural model for the \(p\)-median problem
• Solving the maximal covering location problem with heuristic concentration
• A fast swap-based local search procedure for location problems
• Load balancing and capacity constraints in a hierarchical location model
• Practical aspects associated with location planning for maternal and perinatal assistance in Brazil
• Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
• What you should know about location modeling
• An Overview of Representative Problems in Location Research
• Plant location and procurement planning in knockdown production systems
• Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• The Location of Emergency Service Facilities
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey

This page was built for publication: A branch and bound algorithm for determining locations of long-term care facilities