Assortment optimization over time

详细信息    查看全文

• 作者：James M. Davis ; ^{jmd388@cornell.edu" class="auth_mail" title="E-mail the corresponding author} ; Huseyin Topaloglu ^{ht88@cornell.edu" class="auth_mail" title="E-mail the corresponding author} ; David P. Williamson ^{dpw@cs.cornell.edu" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Choice models ; Revenue management ; Approximation algorithms ; Assortment optimization
• 刊名：Operations Research Letters
• 出版年：2015
• 出版时间：November 2015
• 年：2015
• 卷：43
• 期：6
• 页码：608-611
• 全文大小：350 K

文摘

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/\alpha$-approximation algorithm for the capacitated assortment optimization problem we give a 1/2α$1/2\alpha$-approximation algorithm for this problem.