An Adaptive Algorithm for the Optimal Sample Size in the Non-Stationary Data-Driven Newsvendor Problem

DOI10.1007/978-0-387-48793-9_6zbMath1241.90115OpenAlexW1913909811MaRDI QIDQ3439970

Gokhan Metan, Aurélie Thiele

Publication date: 21 May 2007

Published in: Operations Research/Computer Science Interfaces Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-48793-9_6

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Protecting the data-driven newsvendor against rare events: a correction-term approach ⋮ A Dynamic and Data-Driven Approach to the News Vendor Problem Under Cyclical Demand

This page was built for publication: An Adaptive Algorithm for the Optimal Sample Size in the Non-Stationary Data-Driven Newsvendor Problem