Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems
From MaRDI portal
Publication:764792
DOI10.1155/2011/605629zbMath1233.90123WikidataQ58653872 ScholiaQ58653872MaRDI QIDQ764792
Foroogh Moeen Moghadas, Hossein Taghizadeh Kakhki
Publication date: 14 March 2012
Published in: Advances in Decision Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2011/605629
90C20: Quadratic programming
90C59: Approximation methods and heuristics in mathematical programming
90B22: Queues and service in operations research
90B80: Discrete location and assignment
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems
- A decomposition approach for the probabilistic maximal covering location-allocation problem
- Location-allocation on congested networks
- Review, extension and prediction in emergency service siting models
- A queueing-location model with expected service time dependent queueing disciplines
- A probabilistic heuristic for a computationally difficult set covering problem
- The queueing maximal availability location problem: A model for the siting of emergency vehicles
- Computing approximate solutions of the maximum covering problem with GRASP
- Greedy randomized adaptive search procedures
- The stochastic queue center problem
- Ambulance location and relocation models.
- A bibliography for some fundamental problem categories in discrete location science
- The Stochastic Queue p-Median Problem
- An annotated bibliography of GRASP-Part II: Applications
- Locating emergency services with different priorities: the priority queuing covering location problem
- An annotated bibliography of GRASP – Part I: Algorithms
- Optimal Server Location on a Network Operating as an M/G/1 Queue
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A location model for a facility operating as anM/G/k queue
- A new method for solving capacitated location problems based on a set partitioning approach
