We consider dynamic assortment problems with reusable products, in which each arriving
customer chooses a product within an offered assortment, uses the product for a random …

In this paper, we consider the yet-uncharted assortment optimization problem under the
exponomial choice model, in which the objective is to determine the revenue-maximizing set …

We provide an approximation algorithm for network revenue management problems. In our
approximation algorithm, we construct an approximate policy using value function …

In this paper, we consider the yet-uncharted assortment optimization problem under the
Exponomial choice model, where the objective is to determine the revenue maximizing set …

In online retailing, core operational questions include deciding on the assortment of
products that should be displayed to incoming customers and how to adjust these …

In this chapter, we consider a firm that has finite capacities of several resources that can be
instantly combined into different products with fixed prices. We assume that there is an …