The approximability of assortment optimization under ranking preferences
Year of publication: |
November-December 2018
|
---|---|
Authors: | Aouad, Ali ; Farias, Vivek ; Levi, Retsef ; Segev, Danny |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 66.2018, 6, p. 1661-1669
|
Subject: | assortment optimization | choice models | hardness of approximation | independent set | approximation algorithms | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Sortiment | Retail assortment |
-
Assortment optimization over time
Fonseca, José da, (2015)
-
Constrained assortment optimization under the Markov chain-based choice model
Désir, Antoine, (2020)
-
Real-time optimization of personalized assortments
Golrezaei, Negin, (2014)
- More ...
-
Assortment optimization under consider-then-choose choice models
Aouad, Ali, (2021)
-
Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences
Aouad, Ali, (2017)
-
Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences
Aouad, Ali, (2018)
- More ...