Modeling the budget-constrained dynamic uncapacitated facility location-network design problem and solving it via two efficient heuristics: a case study of health care
DOI10.1016/J.MCM.2012.06.017zbMATH Open1305.90276OpenAlexW2047409904MaRDI QIDQ2256395FDOQ2256395
Authors: Abdolsalam Ghaderi, M. Saeed Jabalameli 
Publication date: 19 February 2015
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2012.06.017
Recommendations
- Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
- Heuristic algorithms for solving an integrated dynamic center facility location -- network design model
- Heuristics for budget facility location-network design problems with minisum objective
- Solutions to facility location-network design problems
- A reliable budget-constrained FL/ND problem with unreliable facilities
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)
Cited In (22)
- The incremental cooperative design of preventive healthcare networks
- Notation and classification for logistic network design models
- Mixed integer programming based heuristics for the patient admission scheduling problem
- Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
- A reliable budget-constrained FL/ND problem with unreliable facilities
- Heuristic algorithms for solving an integrated dynamic center facility location -- network design model
- A combined facility location and network design problem with multi-type of capacitated links
- Optimal number and location of storage hubs and biogas production reactors in farmlands with allocation of multiple feedstocks
- An integrated approach for planning a long-term care network with uncertainty, strategic policy and equity considerations
- Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm
- Sustainable capacitated facility location/network design problem: a non-dominated sorting genetic algorithm based multiobjective approach
- A survey of healthcare facility location
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
- Solutions to facility location-network design problems
- A Lagrangian heuristic algorithm for a public healthcare facility location problem
- Fix-and-optimize approach for a healthcare facility location/network design problem considering equity and accessibility: a case study
- Designing a rural network of dialysis facilities
- A multi-objective and multi-period optimization model for urban healthcare waste's reverse logistics network design
- Heuristics for budget facility location-network design problems with minisum objective
- Budget constrained location problem with opening and closing of facilities.
- Fostering long-term care planning in practice: extending objectives and advancing stochastic treatment within location-allocation modelling
- Considering short-term and long-term uncertainties in location and capacity planning of public healthcare facilities
Uses Software
This page was built for publication: Modeling the budget-constrained dynamic uncapacitated facility location-network design problem and solving it via two efficient heuristics: a case study of health care
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256395)
