A decomposition approach for the probabilistic maximal covering location-allocation problem (original) (raw)
Related papers
RePEc: Research Papers in Economics, 1996
PROBABILISTIC, MAXIMAL COVERING LOCATION– ALLOCATION MODELS FOR CONGESTED SYSTEMS
Vladimir Marianov, Daniel Serra
Probabilistic, Maximal Covering Location—Allocation Models forCongested Systems
Journal of Regional Science, 1998
Hybrid heuristics for the probabilistic maximal covering location-allocation problem
2007
Location–Allocation of Multiple-Server Service Centers with Constrained Queues or Waiting Times
The queuing probabilistic location set covering problem and some extensions
Socio-Economic Planning Sciences, 1994
2000
2012
Maximal Covering Location Problem with Multiple Coverage Requirements
1997
Maximal Benefit Location Problem for A Congested System
2010
Efficient solution of a class of location–allocation problems with stochastic demand and congestion
Computers & Operations Research, 2014
A decomposition heuristic for the maximal covering location problem
Marcos A Pereira, Luiz Antonio Nogueira Lorena, Edson L F Senne
2010
The capacitated maximal covering location problem with backup service
Annals of Operations Research, 1989
Location and allocation of service units on a congested network
IIE Transactions, 2008
Location Modeling Utilizing Maximum Service Distance Criteria
Geographical Analysis, 2010
European Journal of Operational Research, 2016
A hybrid method for the Probabilistic Maximal Covering Location–Allocation Problem
Marcos A Pereira, Leandro C Coelho, Luiz Antonio Nogueira Lorena
2015
Hierarchical location allocation models for congested systems
Vladimir Marianov, Daniel Serra
The probabilistic gradual covering location problem on a network with discrete random demand weights
Computers & Operations Research, 2011
Journal of Optimization in Industrial Engineering, 2019
Capacitated Facility Location with Distance-Dependent Coverage under Demand Uncertainty
Decision Sciences, 1991
Minimisation Of Network Covering Services With Predefined Centres
ECMS 2018 Proceedings edited by Lars Nolle, Alexandra Burger, Christoph Tholen, Jens Werner, Jens Wellhausen, 2018
A LAGRANGEAN/SURROGATE HEURISTIC FOR THE MAXIMAL COVERING LOCATION PROBLEM USING HILLSMANS EDITION
2001
Facility Location with Stochastic Demand and Constraints on Waiting Time
M&som-manufacturing & Service Operations Management, 2008
Journal of the Operational Research Society, 2007
Allocating servers to facilities, when demand is elastic to travel and waiting times
RAIRO - Operations Research, 2005