Online algorithms for the newsvendor problem with and without censored demands
From MaRDI portal
Publication:3587355
Recommendations
- The Censored Newsvendor and the Optimal Acquisition of Information
- An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution
- Comparing online learning algorithms to stochastic approaches for the multi-period newsvendor problem
- Probability-free solutions to the non-stationary newsvendor problem
- Dynamic learning, pricing, and ordering by a censored newsvendor
Cited in
(7)- Response
- An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution
- Censored newsvendor model revisited with unnormalized probabilities
- The data-driven newsvendor problem: new bounds and insights
- Comparing online learning algorithms to stochastic approaches for the multi-period newsvendor problem
- Probability-free solutions to the non-stationary newsvendor problem
- The Censored Newsvendor and the Optimal Acquisition of Information
This page was built for publication: Online algorithms for the newsvendor problem with and without censored demands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587355)