Login / Signup

Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand.

Vineet GoyalRetsef LeviDanny Segev
Published in: Oper. Res. (2016)
Keyphrases
  • learning algorithm
  • stochastic demand
  • machine learning
  • special case
  • dynamic programming