Capacitated multi-period maximal covering location problem with server uncertainty

DOI10.1016/j.ejor.2020.07.061zbMath1487.90451OpenAlexW3048009761MaRDI QIDQ2029288

Publication date: 3 June 2021

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

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

zbMATH Keywords

uncertainty Benders decomposition OR in health services capacitated facility location primary health centers

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (3)

Testing facility location and dynamic capacity planning for pandemics with demand uncertainty ⋮ Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster ⋮ Upgrading edges in the maximal covering location problem

Uses Software

CPLEX

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
The minmax regret gradual covering location problem on a network with incomplete information of demand weights
An improved Benders decomposition applied to a multi-layer network design problem
Partitioning procedures for solving mixed-variables programming problems
Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
A survey of healthcare facility location
The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm
Benders decomposition for very large scale partial set covering and maximal covering location problems
The Benders decomposition algorithm: a literature review
Multi-period stochastic covering location problems: modeling framework and solution approach
Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
A note on the robust 1-center problem on trees
Combinatorial Benders Cuts for the Minimum Tollbooth Problem
A Cross Decomposition Algorithm for Capacitated Facility Location
Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
Minimax regret p-center location on a network with demand uncertainty
Minmax-regret robust 1-median location on a tree
Minmax Regret Median Location on a Network Under Uncertainty
Siting noxious facilities under uncertainty
Benchmarking optimization software with performance profiles.

This page was built for publication: Capacitated multi-period maximal covering location problem with server uncertainty