arXiv:2602. 05799v2 Announce Type: replace-cross Abstract: We study non-stationary single-item, periodic-review inventory control problems in which the demand distribution is unknown and may change over time.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.
arXiv:2606. 14679v1 Announce Type: new Abstract: Online inventory optimization (OIO) is online convex optimization with physical memory: inventory carryover makes the feasible action set depend on the past.
arXiv:2608. 14096v1 Announce Type: new Abstract: The one-warehouse multi-store (OWMS) system is a fundamental inventory network in which a nonreplenishable warehouse allocates shared stock across multiple stores over time.
arXiv:2609.06083v1 Announce Type: new Abstract: To make optimal joint pricing and inventory control decisions is a critical challenge for modern retailers. In practice, retailers face changing market...
The paper presents a data‑driven framework for multi‑period lost‑sales inventory control when demand is censored, meaning stockouts only reveal that demand exceeded the stocking level. It introduces a new cost decomposition for base‑stock policies and a biased sample‑average approximation (SAA) method, leading to two algorithms: an upper‑biased SAA that achieves near‑optimal sample complexity under an offline coverage condition, and a lower‑biased SAA that actively generates coverage to achieve near‑optimal online regret. The biased SAA approach offers a general principle for applying pessimism and optimism in settings with censored feedback.
arXiv:2606. 06201v1 Announce Type: new Abstract: Pharmaceutical supply chains (PSCs) struggle with inventory management (IM) due to unpredictable demand patterns and variable lead times associated with restocking.
arXiv:2609. 28263v1 Announce Type: new Abstract: The growth of large language model (LLM) inference and search services increases the scale of online linear programming problems, motivating computationally efficient algorithms.