We study the classic multi-period joint pricing and inventory control problem in a data-driven setting.In this problem, a retailer makes periodic decisions on the prices and inventory levels of an item that she wishes to sell. The retailer's objective is to maximize the expected profit over a...

This work is inspired by the daily operations of Hema supermarket, which is a recently established “new retail” model by Alibaba Group, China. In a Hema supermarket store, a single SKU may be presented with demand in the form of multiple channels. The challenge facing Hema is to stock...

We propose a new approach for the vehicle routing problem with stochastic customer demands revealed before vehicles are dispatched. We combine ideas from vehicle routing and manufacturing process flexibility to propose overlapped routing strategies with customer sharing. We characterize the...

We study the inventory placement optimization problem, where demand is sensitive to service response time, under the online retailing setting. The main challenge is to achieve the optimal trade-off between revenue benefits from shorter delivery time and inventory operation costs. To predict the...

This paper addresses the capacitated vehicle routing problem with unsplittable stochastic demand (UCVRP), in the limited information regime. We integrate ideas from region partitioning and online bin packing to propose a provably near-optimal and scalable algorithm. Our algorithm performs double...