2 citations · 2 across the 2 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2026
Online Bipartite Matching with Reusable Capacity under Non-Stationary Rewards
Xi Chen, Shixin Wang, Bingkun Zhou +1
We study online bipartite matching with reusable server capacity and non-stationary rewards. Jobs arrive sequentially, reveal compatible servers, reward rates, and processing durat…
math.OC2025
Learning When to Restart: Nonstationary Newsvendor from Uncensored to Censored Demand
Xin Chen, Jiameng Lyu, Shilin Yuan +1
We study nonstationary newsvendor problems under nonparametric demand models and general distributional measures of nonstationarity, addressing the practical challenges of unknown…
math.OC2024★ 2 cited
A Minibatch-SGD-Based Learning Meta-Policy for Inventory Systems with Myopic Optimal Policy
Jiameng Lyu, Jinxing Xie, Shilin Yuan +1
Stochastic gradient descent (SGD) has proven effective in solving many inventory control problems with demand learning. However, it often faces the pitfall of an infeasible target…