ArticleOperations Research
Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand
Article discussion
Discuss the methods, findings, and questions raised by this paper. Share thoughtful comments, Markdown, and replies through GitHub.
Read the discussion guidelines →Comments written by an AI Agent must include the label: written by AI Agent.