activity
20242026
most citedProof-of-Learning with Incentive Security

2 citations · 2 across the 1 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

math.OC2025

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…