Approximation algorithms for dynamic assortment optimization models
Year of publication: |
2019
|
---|---|
Authors: | Aouad, Ali ; Levi, Retsef ; Segev, Danny |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 44.2019, 2, p. 487-511
|
Subject: | assortment planning | inventory management | choice models | dynamic optimization | approximation algorithms | submodularity | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Dynamische Optimierung | Dynamic programming | Lagerhaltungsmodell | Inventory model | Operations Research | Operations research |
-
Truong, Van-Anh, (2014)
-
Approximation algorithms for k-echelon extensions of the one warehouse multi-retailer problem
Stauffer, Gautier, (2018)
-
Gayon, Jean-Philippe, (2017)
- More ...
-
Approximation Algorithms for Dynamic Assortment Optimization Models
Aouad, Ali, (2018)
-
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 ...