The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
The Data-Driven Newsvendor Problem: New Bounds and Insights
Open accessAbstract
Consider the newsvendor model, but under the assumption that the underlying demand distribution is not known as part of the input. Instead, the only information available is a random, independent sample drawn from the demand distribution. This paper analyzes the sample average approximation (SAA) approach for the data-driven newsvendor problem. We obtain a new analytical bound on the probability that the relative regret of the SAA solution exceeds a threshold. This bound is significantly tighter than existing bounds, and it matches the empirical accuracy of the SAA solution observed in extensive computational experiments. This bound reveals that the demand distribution’s weighted mean spread affects the accuracy of the SAA heuristic.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Jeffreys, H., Moran, P. A. P., & Chatfield, C. (1922) · Nature · doi:10.1093/oso/9780198503682.001.0001 · Cited by 7,878
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500830 · Cited by 4,852
The Sample Average Approximation Method for Stochastic Discrete Optimization
Kleywegt, A. J., Shapiro, A., & Homem-de-Mello, T. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499363220 · Cited by 1,983
Foundations of Inventory Management
Zipkin, P. H. (2000) · Medical Entomology and Zoology · Cited by 1,854
Stochastic Simulation: Algorithms and Analysis
Asmussen, S., & Glynn, P. W. (2007) · Stochastic Modelling and Applied Probability · doi:10.1007/978-0-387-69033-9 · Cited by 1,121
A Robust Optimization Approach to Inventory Theory
Bertsimas, D., & Thiele, A. (2006) · Operations Research · doi:10.1287/opre.1050.0238 · Cited by 705
Studies in Mathematical Theory of Inventory and Production
Vadja, S., Arrow, K. J., Karlin, S., Scarf, H., Hurwicz, L., & Uzawa, H. (1959) · Revue de l'Institut International de Statistique / Review of the International Statistical Institute · doi:10.2307/1402060 · Cited by 696
Gradient Estimation via Perturbation Analysis
(1991) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(91)90124-l · Cited by 692
Online convex optimization in the bandit setting: gradient descent without a gradient
Flaxman, A. D., Kalai, A. T., & McMahan, H. B. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0408007 · Cited by 546
The empirical behavior of sampling methods for stochastic programming
Linderoth, J., Shapiro, A., & Wright, S. (2006) · Annals of Operations Research · doi:10.1007/s10479-006-6169-8 · Cited by 425
Regret in the Newsvendor Model with Partial Information
Perakis, G., & Roels, G. (2008) · Operations Research · doi:10.1287/opre.1070.0486 · Cited by 355
Self-citationBayes Solutions of the Statistical Inventory Problem
Scarf, H. (1959) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706264 · Cited by 318
Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models
Levi, R., ROUNDY, R. O., & Shmoys, D. B. (2007) · Mathematics of Operations Research · doi:10.1287/moor.1070.0272 · Cited by 306
Self-citationStalking Information: Bayesian Inventory Management with Unobserved Lost Sales
Lariviere, M. A., & Porteus, E. L. (1999) · Management Science · doi:10.1287/mnsc.45.3.346 · Cited by 257
A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand
Huh, W. T., & Rusmevichientong, P. (2009) · Mathematics of Operations Research · doi:10.1287/moor.1080.0355 · Cited by 219
A practical inventory control policy using operational statistics
Liyanage, L. H., & Shanthikumar, J. G. (2005) · Operations Research Letters · doi:10.1016/j.orl.2004.08.003 · Cited by 215
Stochastic Optimization: Algorithms and Applications
(2001) · Applied Optimization · doi:10.1007/978-1-4757-6594-6 · Cited by 198
On Implications of Demand Censoring in the Newsvendor Problem
Besbes, O., & Muharremoglu, A. (2013) · Management Science · doi:10.1287/mnsc.1120.1654 · Cited by 176
Toward Robust Revenue Management: Competitive Analysis of Online Booking
Ball, M. O., & Queyranne, M. (2009) · Operations Research · doi:10.1287/opre.1080.0654 · Cited by 155
Estimation of Inventory Re-Order Levels Using the Bootstrap Statistical Procedure
Bookbinder, J. H., & Lordahl, A. E. (1989) · IIE Transactions · doi:10.1080/07408178908966236 · Cited by 117
Toward Robust Revenue Management: Competitive Analysis of Online BookingPreprint
Queyranne, M., & Ball, M. O. (2006) · SSRN Electronic Journal · doi:10.2139/ssrn.896547 · Cited by 27
Cited by
Distributionally Robust Convex Optimization
Wiesemann, W., Kuhn, D., & Sim, M. (2014) · Operations Research · doi:10.1287/opre.2014.1314 · Cited by 947
Distributionally Robust Stochastic Optimization with Wasserstein Distance
Gao, R., & Kleywegt, A. (2023) · Mathematics of Operations Research · doi:10.1287/moor.2022.1275 · Cited by 630
The Big Data Newsvendor: Practical Insights from Machine Learning
Ban, G.-Y., & Rudin, C. (2019) · Operations Research · doi:10.1287/opre.2018.1757 · Cited by 507
Ning, C., & You, F. (2019) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2019.03.034 · Cited by 343
Literature review of deteriorating inventory models by key topics from 2012 to 2015
Janssen, L., Claus, T., & Sauer, J. (2016) · International Journal of Production Economics · doi:10.1016/j.ijpe.2016.08.019 · Cited by 299
Metadata
- Authors
- Levi, R., Perakis, G., & Uichanco, J.
- Venue
- Operations Research
- Published
- 2015-12
- Volume
- 63
- Issue
- 6
- Pages
- 1294-1306
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W1828651507
- Cited by
- 256
- References
- 23
- FWCI
- 21.20
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.