A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
From MaRDI portal
Publication:322691
DOI10.1016/j.ejor.2015.11.025zbMath1346.90524OpenAlexW2176170710MaRDI QIDQ322691
Sachin Jayaswal, Amit Kumar Vatsa
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.11.025
Related Items
The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm ⋮ The incremental cooperative design of preventive healthcare networks ⋮ Multi-period stochastic covering location problems: modeling framework and solution approach ⋮ Multiple allocation hub interdiction and protection problems: model formulations and solution approaches ⋮ Large-scale influence maximization via maximal covering location ⋮ Capacitated multi-period maximal covering location problem with server uncertainty
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- The impact of client choice on preventive healthcare facility network design
- The minmax regret gradual covering location problem on a network with incomplete information of demand weights
- Efficient primal-dual heuristic for a dynamic location problem
- A memetic algorithm for multi-objective dynamic location problems
- Generalized coverage: new developments in covering location models
- An improved Benders decomposition applied to a multi-layer network design problem
- Partitioning procedures for solving mixed-variables programming problems
- A comparative study of approaches to dynamic location problems
- Dynamic versions of set covering type public facility location problems
- Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
- The gradual covering decay location problem on a network.
- Budget constrained location problem with opening and closing of facilities.
- Use of location-allocation models in health service development planning in developing nations
- A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty
- A survey on Benders decomposition applied to fixed-charge network design problems
- A note on the robust 1-center problem on trees
- Location of preventive health care facilities
- Algorithms for a facility location problem with stochastic customer demand and immobile servers
- A maximal covering location model in the presence of partial coverage
- Modeling the budget-constrained dynamic uncapacitated facility location-network design problem and solving it via two efficient heuristics: a case study of health care
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Simultaneous Location of Trauma Centers and Helicopters for Emergency Medical Service Planning
- Combinatorial Benders Cuts for the Minimum Tollbooth Problem
- Locating emergency services with different priorities: the priority queuing covering location problem
- An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
- Multicommodity Distribution System Design by Benders Decomposition
- The Multiperiod Location-Allocation Problem with Relocation of Facilities
- 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
- Capacitated dynamic location problems with opening, closure and reopening of facilities
- On solving complex multi-period location models using simulated annealing.
- An algorithm for the capacitated, multi-commodity multi-period facility location problem.
- Siting noxious facilities under uncertainty
