Finding an optimal core on a tree network with M/G/c/c state-dependent queues

DOI10.1007/s00186-018-0651-3zbMath1412.90035OpenAlexW2898374283MaRDI QIDQ1731597

James MacGregor Smith, Mehrdad Moshtagh, Jafar Fathali, Nezam Mahdavi-Amiri

Publication date: 13 March 2019

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-018-0651-3

zbMATH Keywords

facility locationqueueing theorycore of a tree networkM/G/c/c state-dependent queuestochastic queue core

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Gaussian processes (60G15) Queues and service in operations research (90B22)

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Location-allocation on congested networks
• Modeling circulation systems in buildings using state dependent queueing models
• Generalized \(M/G/C/C\) state dependent queueing models and pedestrian traffic flows
• Finding the \(\ell\)-core of a tree
• The stochastic queue core problem, evacuation networks, and state-dependent queues
• Algorithms for path medi-centers of a tree
• Algorithms for a facility location problem with stochastic customer demand and immobile servers
• Finding a core of a tree with pos/neg weight
• A branch-and-cut algorithm for the median-path problem
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• Locating a Mobile Server Queueing Facility on a Tree Network
• Technical Note—The Stochastic Queue Median Over a Finite Discrete Set
• A location model for a facility operating as anM/G/k queue
• A Proof for the Queuing Formula: L = λW
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• A linear algorithm for a core of a tree
• Modeling Vehicular Traffic Flow using M/G/C/C State Dependent Queueing Models
• Computing the 2‐median on tree networks in O(n lg n) time
• Finding cores of limited length
• The multiple server location problem

This page was built for publication: Finding an optimal core on a tree network with M/G/c/c state-dependent queues