A Lagrangian heuristic algorithm for a public healthcare facility location problem
From MaRDI portal
Publication:363567
DOI10.1007/s10479-013-1378-4zbMath1271.90043MaRDI QIDQ363567
Publication date: 3 September 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-013-1378-4
Related Items
Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities, Solving a dynamic facility location problem with partial closing and reopening, A survey of healthcare facility location, The incremental cooperative design of preventive healthcare networks, An exact and a heuristic approach for the transportation-\(p\)-facility location problem
Cites Work
- Unnamed Item
- Designing emergency response networks for hazardous materials transportation
- Competitive facility location and design problem
- Location of a facility minimizing nuisance to or from a planar network
- A branch and bound algorithm for determining locations of long-term care facilities
- Allocation search methods for a generalized class of location-allocation problems
- Incorporating congestion in preventive healthcare facility network design
- Competitive location with rectilinear distances
- On locating new facilities in a competitive environment
- The queueing maximal availability location problem: A model for the siting of emergency vehicles
- An improved branch \& bound method for the uncapacitated competitive location problem
- 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 of preventive health care facilities
- Locating multiple competitive facilities: Spatial interaction models with variable expenditures
- Constrained location of competitive facilities in the plane
- A neural model for the \(p\)-median problem
- Solving the maximal covering location problem with heuristic concentration
- Discrete models for competitive location with foresight
- Modeling health care facility location for moving population groups
- A fast swap-based local search procedure for location problems
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Plant location and procurement planning in knockdown production systems
- Optimal location of public health centres which provide free and paid services
- Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
- Planar maximal covering location problem under block norm distance measure
- The Location of Emergency Service Facilities
