Multi-period stochastic covering location problems: modeling framework and solution approach
type: Item
instance of: scholarly article
title: Multi-period stochastic covering location problems: modeling framework and solution approach
zbMATH Open document ID: 1403.90482
author: Alfredo Marín
author: Luisa I. Martínez-Merino
author: Antonio M. Rodríguez-Chía
author: Francisco Saldanha-da-Gama
published in: European Journal of Operational Research
publication date: 2018-05-30T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6876713
zbMATH Keywords: location
zbMATH Keywords: covering
zbMATH Keywords: discrete optimization
zbMATH Keywords: multi-period facility location
zbMATH Keywords: Lagrangian relaxation
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.01.040
OpenAlex ID: W2789344326
cites work: Multi-period reverse logistics network design
cites work: Generalized coverage: new developments in covering location models
cites work: Introduction to Stochastic Programming
cites work: Algorithms for the set covering problem
cites work: Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model
cites work: The multimode covering location problem
cites work: A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
cites work: Lagrangean relaxation. (With comments and rejoinder).
cites work: Dynamic versions of set covering type public facility location problems
cites work: The Maximum Coverage Location Problem
cites work: Q4943600
cites work: A multiperiod set covering location model for dynamic redeployment of ambulances
cites work: Q4229605
cites work: The Location of Emergency Service Facilities
cites work: A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
cites work: The large-scale dynamic maximal covering location problem
DOI: 10.1016/J.EJOR.2018.01.040
description: scientific article; zbMATH DE number 6876713