Capacitated multi-period maximal covering location problem with server uncertainty
From MaRDI portal
Publication:2029288
Recommendations
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
- A Benders decomposition algorithm for the maximum availability service facility location problem
- A decomposition approach for the probabilistic maximal covering location-allocation problem
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Multi-period stochastic covering location problems: modeling framework and solution approach
Cites work
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
- A note on the robust 1-center problem on trees
- A survey of healthcare facility location
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- An improved Benders decomposition applied to a multi-layer network design problem
- Benchmarking optimization software with performance profiles.
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Combinatorial Benders cuts for the minimum tollbooth problem
- Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
- scientific article; zbMATH DE number 1279217 (Why is no real title available?)
- scientific article; zbMATH DE number 949665 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- Minimax regret p-center location on a network with demand uncertainty
- Minmax Regret Median Location on a Network Under Uncertainty
- Minmax-regret robust 1-median location on a tree
- Multi-period stochastic covering location problems: modeling framework and solution approach
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Partitioning procedures for solving mixed-variables programming problems
- Siting noxious facilities under uncertainty
- The Benders decomposition algorithm: a literature review
- The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm
- The minmax regret gradual covering location problem on a network with incomplete information of demand weights
Cited in
(8)- A Benders decomposition algorithm for the maximum availability service facility location problem
- 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
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
- A multi-period vaccines supply chain network design with capacity expansion and different replenishment cycles under uncertain demand
- Modelling a capacitated location problem for designing multimodal vaccine distribution network using a novel health emergency susceptibility index
- Exact methods and a variable neighborhood search for the robust capacitated p-median problem
This page was built for publication: Capacitated multi-period maximal covering location problem with server uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029288)
