Online algorithms for the newsvendor problem with and without censored demands

DOI10.1007/978-3-642-14553-7_23zbMATH Open1288.68289OpenAlexW1593793048MaRDI QIDQ3587355FDOQ3587355

Authors: Peter Sempolinski, Amitabh Chaudhary 

Publication date: 7 September 2010

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14553-7_23

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

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Inventory, storage, reservoirs (90B05)

Cited In (7)

• Probability-free solutions to the non-stationary newsvendor problem
• The Censored Newsvendor and the Optimal Acquisition of Information
• The data-driven newsvendor problem: new bounds and insights
• 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
• Response
• Censored newsvendor model revisited with unnormalized probabilities

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)