7 citations · 19 across the 6 of their papers we have counts for
Showing math.OCShow all
2 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.OC2024
A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints
Xi Chen, Mo Liu, Yining Wang +1
In this paper, we consider a multi-stage dynamic assortment optimization problem with multi-nomial choice modeling (MNL) under resource knapsack constraints. Given the current reso…