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

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.

Business & Economics

Engineering & Materials Science