Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences
Year of publication: |
September-October 2018
|
---|---|
Authors: | Aouad, Ali ; Levi, Retsef ; Segev, Danny |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 66.2018, 5, p. 1321-1345
|
Subject: | inventory management | dynamic substitution | approximation algorithms | submodularity | multinomial logit choice model | Logit-Modell | Logit model | Theorie | Theory | Algorithmus | Algorithm | Diskrete Entscheidung | Discrete choice | Mathematische Optimierung | Mathematical programming |
-
Approximation algorithms for dynamic assortment optimization models
Aouad, Ali, (2019)
-
A note on a tight lower bound for capacitated MNL-bandit assortment selection models
Chen, Xi, (2018)
-
Optimal policy for dynamic assortment planning under multinomial logit models
Chen, Xi, (2021)
- More ...
-
Approximation algorithms for dynamic assortment optimization models
Aouad, Ali, (2019)
-
The approximability of assortment optimization under ranking preferences
Aouad, Ali, (2018)
-
Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences
Aouad, Ali, (2017)
- More ...