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

出版年份 2016 全文链接

标题

作者

关键词

出版物

Volume 64, Issue 1, Pages 219-235

出版商

Institute for Operations Research and the Management Sciences (INFORMS)

发表日期

2016-01-07

DOI

10.1287/opre.2015.1450

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started