Optimal number of bypasses: minimizing cost of calls to wireless phones under calling party pays

DOI10.1007/s10479-011-0993-1zbMath1251.90079OpenAlexW2008947625MaRDI QIDQ1761755

Xianqiang Yang

Publication date: 15 November 2012

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

Full work available at URL: https://doi.org/10.1007/s10479-011-0993-1

zbMATH Keywords

inventory modelscommunicationstelephonycalling party paysrental situationswireless bypasses

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Communication networks in operations research (90B18)

Related Items (2)

Optimal size of a rental inventory with items available from a secondary source: a model with non-stationary probabilities ⋮ Minimum cost in a mix of new and old reusable items: an application to sizing a fleet of delivery trucks

Cites Work

• Unnamed Item
• Queues with switchover. -- A review and critique
• Queueing models of call centers: An introduction
• Some Stochastic Inventory Models for Rental Situations
• AN INVENTORY PROBLEM APPLIED TO A RENTAL SITUATION

This page was built for publication: Optimal number of bypasses: minimizing cost of calls to wireless phones under calling party pays