Near-optimal algorithms for the assortment planning problem under dynamic substitution and Stochastic Demand

Vineet Goyal, Retsef Levi, Danny Segev

Research output: Contribution to journalArticlepeer-review

50 Scopus citations

Fingerprint

Dive into the research topics of 'Near-optimal algorithms for the assortment planning problem under dynamic substitution and Stochastic Demand'. Together they form a unique fingerprint.

Keyphrases

Computer Science

Social Sciences

Economics, Econometrics and Finance