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 | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Präferenztheorie | Theory of preferences |
-
Assortment optimization over time
Fonseca, José da, (2015)
-
On some variants of Euclidean k-supplier
Lee, Euiwoong, (2022)
-
Submodular maximization through the lens of linear programming
Bruggmann, Simon, (2019)
- More ...
-
Assortment optimization under consider-then-choose choice models
Aouad, Ali, (2021)
-
Approximation Algorithms for Dynamic Assortment Optimization Models
Aouad, Ali, (2018)
-
The Approximability of Assortment Optimization Under Ranking Preferences
Aouad, Ali, (2018)
- More ...