Capacitated multi-period maximal covering location problem with server uncertainty
type: Item
instance of: scholarly article
title: Capacitated multi-period maximal covering location problem with server uncertainty
zbMATH Open document ID: 1487.90451
author: Amit Kumar Vatsa
author: Sachin Jayaswal
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 7354519
zbMATH Keywords: OR in health services
zbMATH Keywords: primary health centers
zbMATH Keywords: capacitated facility location
zbMATH Keywords: Benders decomposition
zbMATH Keywords: uncertainty
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.07.061
OpenAlex ID: W3048009761
cites work: A survey of healthcare facility location
cites work: Minimax regret p-center location on a network with demand uncertainty
cites work: Minmax Regret Median Location on a Network Under Uncertainty
cites work: Combinatorial Benders Cuts for the Minimum Tollbooth Problem
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: The minmax regret gradual covering location problem on a network with incomplete information of demand weights
cites work: A note on the robust 1-center problem on trees
cites work: Minmax-regret robust 1-median location on a tree
cites work: Benders decomposition for very large scale partial set covering and maximal covering location problems
cites work: Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
cites work: Benchmarking optimization software with performance profiles.
cites work: Q5538132
cites work: An improved Benders decomposition applied to a multi-layer network design problem
cites work: Siting noxious facilities under uncertainty
cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
cites work: Multi-period stochastic covering location problems: modeling framework and solution approach
cites work: The Benders decomposition algorithm: a literature review
cites work: Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
cites work: Q4239707
cites work: A Cross Decomposition Algorithm for Capacitated Facility Location
cites work: A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
cites work: Q4716341
cites work: The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm
DOI: 10.1016/J.EJOR.2020.07.061
description: scientific article; zbMATH DE number 7354519