Optimal static pricing for a tree network

DOI10.1007/S10479-012-1115-4zbMath1251.90372OpenAlexW1567939692MaRDI QIDQ1761804

Felipe Caro, David Simchi-Levi

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-012-1115-4

zbMATH Keywords

fixed-point equationstochastic knapsackproduct-formquasiconcavityErlang loss systemphone cardsreduced load approximation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15)

Related Items (1)

Revenue management on an on-demand service platform

Cites Work

• Unnamed Item
• Unnamed Item
• Loss networks
• Generalized concavity
• Computational algorithms for blocking probabilities in circuit-switched networks
• Admission Policies in Loss Queueing Models with Heterogeneous Arrivals
• On the convexity of loss probabilities
• Mean-variance trade-offs in supply contracts
• Convexity Properties of the Erlang Loss Formula
• Algorithms to determine exact blocking probabilities for multirate tree networks
• Monotonicity properties for the stochastic knapsack
• A note on optimal pricing for finite capacity queueing systems with multiple customer classes

This page was built for publication: Optimal static pricing for a tree network