Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand
Vineet Goyal (Department of Industrial Engineering and Operations Research, Columbia University, New York, New York), Retsef Levi (Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts), Danny Segev (Department of Statistics, University of Haifa, Haifa, Israel)
| Year of publication: |
January-February 2016
|
|---|---|
| Authors: | Goyal, Vineet ; Levi, Retsef ; Segev, Danny |
| Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 64.2016, 1, p. 219-235
|
| Subject: | assortment planning | dynamic substitution | polynomial time approximation schemes | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Sortiment | Retail assortment |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/opre.2015.1450 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011447869