We study the incremental knapsack problem, where one wishes to sequentially pack items into a knapsack whose capacity expands over a finite planning horizon, with the objective of maximizing time-a…
We study the dynamic assortment planning problem under the widely utilized multinomial logit choice model (MNL). In this single-period assortment optimization and inventory management problem, the …
The main contribution of this paper resides in proposing a carefully crafted dynamic programming approach for capacitated assortment optimization under the nested logit model in its utmost generali…
In this paper, we consider the assortment problem under the multinomial logit (MNL) model with sequential offerings recently proposed by Liu et al. [INFORMS J. Comput., 2020] to capture a multitude…
We study a recently introduced generalization of the classic sequential testing problem for series systems, consisting of multiple stochastic components. The conventional assumption in such setting…
Assortment optimization is an important problem arising in many applications, including retailing and online advertising. The goal in such problems is to determine a revenue-/profit-maximizing subs…
We introduce a new optimization model, dubbed the display optimization problem, that captures a common aspect of choice behavior, known as the framing bias. In this setting, the objective is to opt…