Approximation Algorithms for Dynamic Assortment Optimization Models
Year of publication: |
2018
|
---|---|
Authors: | Aouad, Ali |
Other Persons: | Levi, Retsef (contributor) ; Segev, Danny (contributor) |
Publisher: |
[2018]: [S.l.] : SSRN |
Subject: | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
Extent: | 1 Online-Ressource (39 p) |
---|---|
Type of publication: | Book / Working Paper |
Language: | English |
Notes: | Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments August 8, 2015 erstellt |
Other identifiers: | 10.2139/ssrn.2641268 [DOI] |
Source: | ECONIS - Online Catalogue of the ZBW |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el, (2018)
- More ...
-
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)
-
Approximation algorithms for dynamic assortment optimization models
Aouad, Ali, (2019)
- More ...