14 citations · 24 across the 9 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.OC2021★ 2 cited
The Value of Robust Assortment Optimization Under Ranking-based Choice Models
Bradley Sturt
We study a class of robust assortment optimization problems that was proposed by Farias, Jagabathula, and Shah (2013). The goal in these problems is to find an assortment that maxi…
math.OC2021
A nonparametric algorithm for optimal stopping based on robust optimization
Bradley Sturt
Optimal stopping is a fundamental class of stochastic dynamic optimization problems with numerous applications in finance and operations management. We introduce a new approach for…