Filtering policies in loss queueing network location problems
type: Item
instance of: scholarly article
title: Filtering policies in loss queueing network location problems
zbMATH Open document ID: 1114.90019
author: Yolanda Hinojosa
author: Elena Fernández
author: Justo Puerto
published in: Annals of Operations Research
publication date: 2006-03-09T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 5010092
zbMATH Keywords: facility location
zbMATH Keywords: multichannel queues
describes a project that uses: LEDA
MaRDI profile type: MaRDI publication profile
Wikidata QID: Q58217290
full work available at URL: s10479-005-2048-y
OpenAlex ID: W2127156429
cites work: Single Server Queueing-Location Models with Rejection
cites work: Q3134873
cites work: Admission policies in loss queueing models with heterogeneous arrivals
cites work: Locating an n-server facility in a stochastic environment
cites work: A note on a stochastic location problem
cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
cites work: Hyperbolic 0-1 programming and query optimization in information retrieval
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: The Streetwalker’s Dilemma: A Job Shop Model
cites work: Q4001300
cites work: Q4833811
cites work: Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel
DOI: 10.1007/S10479-005-2048-Y
DBLP publication ID: journals/anor/FernandezHP05
Recommended article: Bounds and policies for dynamic routing in loss networks
Recommended article: Location-allocation on congested networks
Recommended article: Q3706805
Recommended article: Optimal Server Location on a Network Operating as an M/G/1 Queue
Recommended article: The location-dispatching problem: polyhedral results and content delivery network design
Recommended article: Least Busy Alternative Routing in Queueing and Loss Networks
Recommended article: A network location-allocation model trading off flow capturing and \(p\)- median objectives
Recommended article: Performance bounds for queueing networks and scheduling policies
description: scientific article; zbMATH DE number 5010092