| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142276 | Operations Research Letters | 2015 | 4 Pages |
Abstract
In this note we introduce the problem of assortment optimization over time. We have a sequence of time steps and can introduce one new product per time step. Once introduced a product cannot be removed. The goal is to determine which products to introduce so as to maximize revenue over all time steps under some choice model. Given a 1/α1/α-approximation algorithm for the capacitated assortment optimization problem we give a 1/2α1/2α-approximation algorithm for this problem.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
James M. Davis, Huseyin Topaloglu, David P. Williamson,