Optimal static pricing for a tree network

DOI10.1007/S10479-012-1115-4zbMATH Open1251.90372OpenAlexW1567939692MaRDI QIDQ1761804FDOQ1761804

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

stochastic knapsackfixed-point equationproduct-formquasiconcavityErlang loss systemphone cardsreduced load approximation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on optimal pricing for finite capacity queueing systems with multiple customer classes
• Loss networks
• Generalized concavity
• Mean-variance trade-offs in supply contracts
• Convexity Properties of the Erlang Loss Formula
• Monotonicity properties for the stochastic knapsack
• Admission policies in loss queueing models with heterogeneous arrivals
• On the convexity of loss probabilities
• Algorithms to determine exact blocking probabilities for multirate tree networks
• Computational algorithms for blocking probabilities in circuit-switched networks

Cited In (4)

• Decentralized pricing in minimum cost spanning trees
• Revenue management on an on-demand service platform
• Approximation and Online Algorithms
• A network flow approach to cost allocation for rooted trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761804)