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

DOI10.1016/J.EJOR.2010.02.001zbMATH Open1188.90149OpenAlexW2027230222MaRDI QIDQ976416FDOQ976416

Authors: Dong-Guen Kim, Yeong-Dae 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

Recommendations

• Hybrid metaheuristic method for determining locations for long-term health care facilities
• An Algorithm for the Facility Location Problem with Consideration to the Constructing Period :A Case for Two Construction Periods
• A variable neighbourhood search method for solving the long-term care facility location problem
• Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional
• A branch-and-bound algorithm for the multi-level uncapacitated facility location problem

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)

Cites Work

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

Cited In (9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976416)