Name
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 / α -approximation algorithm for the capacitated assortment optimization problem we give a 1 / 2 α -approximation algorithm for this problem. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.orl.2015.08.007 | Operations Research Letters |
Keywords | DocType | Volume |
Choice models,Revenue management,Approximation algorithms,Assortment optimization | Journal | 43 |
Issue | ISSN | Citations |
6 | 0167-6377 | 0 |
PageRank | References | Authors |
0.34 | 16 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| James M. Davis | 1 | 36 | 4.27 |
| Huseyin Topaloglu | 2 | 458 | 33.78 |
| David P. Williamson | 3 | 3564 | 413.34 |