Nonparametric data-driven learning algorithms for multilocation inventory systems

DOI10.1016/J.ORL.2024.107163MaRDI QIDQ6988292zbMATH OpenFDO

Authors Zijun Zhong, Zhou He

Publication date 5 May 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2024.107163

zbMATH Keywords

multilocation inventory systemnonparametric learningonline convex optimizationregret

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Inventory, storage, reservoirs (90B05) Convex programming (90C25) Applications of mathematical programming (90C90)

Cites work

• A nonparametric asymptotic analysis of inventory planning with censored demand
• An explicit upper bound for the mean busy period in a GI/G/1 queue
• Existence of coordinating transshipment prices in a two-location inventory model
• Logarithmic regret algorithms for online convex optimization
• Optimal and Approximate Policies in Multiperiod, Multilocation Inventory Models with Transshipments
• Optimal Joint Inventory and Transshipment Control Under Uncertain Capacity
• Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models
• Technical note -- Data-driven newsvendor problem: performance of the sample average approximation
• Technical note: Nonparametric data-driven algorithms for multiproduct inventory systems with censored demand
• The data-driven newsvendor problem: new bounds and insights
• The elements of joint learning and optimization in operations management

This page was built for publication: Nonparametric data-driven learning algorithms for multilocation inventory systems

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