Filtering policies in loss queueing network location problems

DOI10.1007/s10479-005-2048-yzbMath1114.90019OpenAlexW2127156429WikidataQ58217290 ScholiaQ58217290MaRDI QIDQ816422

Yolanda Hinojosa, Justo Puerto, Elena Fernández

Publication date: 9 March 2006

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

Full work available at URL: https://doi.org/10.1007/s10479-005-2048-y

zbMATH Keywords

facility locationmultichannel queues

Mathematics Subject Classification ID

Stochastic programming (90C15) Queues and service in operations research (90B22)

Related Items (1)

A finite dominating set of cardinality \(O(k)\) and a witness set of cardinality \(O(n)\) for 1.5D terrain guarding problem

Uses Software

• LEDA

Cites Work

• A note on a stochastic location problem
• Locating an n-server facility in a stochastic environment
• Hyperbolic 0-1 programming and query optimization in information retrieval
• Admission Policies in Loss Queueing Models with Heterogeneous Arrivals
• Optimal two- and three-stage production schedules with setup times included
• Single Server Queueing-Location Models with Rejection
• Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel
• The Streetwalker’s Dilemma: A Job Shop Model
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Filtering policies in loss queueing network location problems