Approximation Algorithms for Dynamic Assortment Optimization Models

© 2018 INFORMS We consider the single-period joint assortment and inventory planning problem with stochastic demand and dynamic substitution across products, motivated by applications in highly differentiated markets, such as online retailing and airlines. This class of problems is known to be notor...

Full description

Bibliographic Details
Main Authors: Aouad, Ali, Levi, Retsef, Segev, Danny
Other Authors: Sloan School of Management
Format: Article
Language:English
Published: Institute for Operations Research and the Management Sciences (INFORMS) 2021
Online Access:https://hdl.handle.net/1721.1/135083