Joint Assortment and Inventory Planning Under the Markov Chain Choice Model

References

• Aouad A, Segev D (2023) The stability of MNL-based demand under dynamic customer substitution and its algorithmic implications. Oper. Res. 71(4):1216–1249.Link, Google Scholar
• Aouad A, Levi R, Segev D (2018) Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences. Oper. Res. 66(5):1321–1345.Link, Google Scholar
• Bai Y, El Housni O, Rusmevichientong P, Topaloglu H (2025) Coordinated inventory stocking and assortment customization. Oper. Res. 73(6):2953–2971.Link, Google Scholar
• Besbes O, Mouchtaki O (2023) How big should your data really be? Data-driven newsvendor: Learning one sample at a time. Management Sci. 69(10):5848–5865.Link, Google Scholar
• Blanchet J, Gallego G, Goyal V (2016) A Markov chain approximation to choice modeling. Oper. Res. 64(4):886–905.Link, Google Scholar
• Brynjolfsson E, Hu YJ, Smith MD (2006) From niches to riches: Anatomy of the long tail. Sloan Management Rev. 47(4):67–71.Google Scholar
• Cachon GP, Terwiesch C, Xu Y (2005) Retail assortment planning in the presence of consumer search. Manufacturing Service Oper. Management 7(4):330–346.Link, Google Scholar
• Chen X, Feldman J, Jung SH, Kouvelis P (2022) Approximation schemes for the joint inventory selection and online resource allocation problem. Production Oper. Management 31(8):3143–3159.Crossref, Google Scholar
• Désir A, Goyal V, Zhang J (2022) Capacitated assortment optimization: Hardness and approximation. Oper. Res. 70(2):893–904.Link, Google Scholar
• Désir A, Goyal V, Segev D, Ye C (2020) Constrained assortment optimization under the Markov chain–Based choice model. Management Sci. 66(2):698–721.Link, Google Scholar
• Doerr B (2020) Probabilistic Tools for the Analysis of Randomized Optimization Heuristics (Springer International Publishing, Cham, Switzerland).Crossref, Google Scholar
• El Housni O, Topaloglu H (2023) Joint assortment optimization and customization under a mixture of multinomial logit models: On the value of personalized assortments. Oper. Res. 71(4):1197–1215.Link, Google Scholar
• Farahat A, Lee J (2018) The multiproduct newsvendor problem with customer choice. Oper. Res. 66(1):123–136.Link, Google Scholar
• Feldman JB, Topaloglu H (2017) Revenue management under the Markov chain choice model. Oper. Res. 65(5):1322–1342.Link, Google Scholar
• Gallego G, Topaloglu H (2019) Revenue Management and Pricing Analytics, vol. 209 (Springer, Berlin).Crossref, Google Scholar
• Gaur V, Honhon D (2006) Assortment planning and inventory decisions under a locational choice model. Management Sci. 52(10):1528–1543.Link, Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Goyal V, Levi R, Segev D (2016) Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand. Oper. Res. 64(1):219–235.Link, Google Scholar
• Honhon D, Seshadri S (2013) Fixed vs. random proportions demand models for the assortment planning problem under stockout-based substitution. Manufacturing Service Oper. Management 15(3):378–386.Link, Google Scholar
• Honhon D, Gaur V, Seshadri S (2010) Assortment planning and inventory decisions under stockout-based substitution. Oper. Res. 58(5):1364–1379.Link, Google Scholar
• Kleywegt AJ, Shapiro A, Homem-de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Kök AG, Fisher ML (2007) Demand estimation and assortment optimization under substitution: Methodology and application. Oper. Res. 55(6):1001–1021.Link, Google Scholar
• Kök AG, Fisher ML, Vaidyanathan R (2008) Retail supply chain management: Quantitative models and empirical studies. Assortment Planning: Review of Literature and Industry Practice(Springer, Berlin), 99–153.Google Scholar
• Levi R, Perakis G, Uichanco J (2015) The data-driven newsvendor problem: New bounds and insights. Oper. Res. 63(6):1294–1306.Link, Google Scholar
• Liang A, Jasin S, Uichanco J (2021) Assortment and inventory planning under dynamic substitution with MNL model: An LP approach and an asymptotically optimal policy. Technical report, University of Michigan, Ann Arbor.Google Scholar
• Lin M, Huh WT, Krishnan H, Uichanco J (2022) Data-driven newsvendor problem: Performance of the sample average approximation. Oper. Res. 70(4):1996–2012.Link, Google Scholar
• Ma W, Simchi-Levi D (2020) Algorithms for online matching, assortment, and pricing with tight weight-dependent competitive ratios. Oper. Res. 68(6):1787–1803.Link, Google Scholar
• Mahajan S, van Ryzin G (2001) Stocking retail assortments under dynamic consumer substitution. Oper. Res. 49(3):334–351.Link, Google Scholar
• Nagarajan M, Rajagopalan S (2008) Inventory models for substitutable products: Optimal policies and heuristics. Management Sci. 54(8):1453–1466.Link, Google Scholar
• Netessine S, Rudi N (2003) Centralized and competitive inventory models with demand substitution. Oper. Res. 51(2):329–335.Link, Google Scholar
• Parlar M, Goyal S (1984) Optimal ordering decisions for two substitutable products with stochastic demands. Oper. Res. 21(1):1–15.Google Scholar
• Rusmevichientong P, Sumida M, Topaloglu H (2020) Dynamic assortment optimization for reusable products with random usage durations. Management Sci. 66(7):2820–2844.Link, Google Scholar
• Smith SA, Agrawal N (2000) Management of multi-item retail inventory systems with demand substitution. Oper. Res. 48(1):50–64.Link, Google Scholar
• Sun S, Udwani R, et al. (2024) A unified algorithmic framework for dynamic assortment optimization under MNL choice. Preprint, submitted April 4, https://arxiv.org/abs/2404.03604.Google Scholar
• Topaloglu H (2013) Joint stocking and product offer decisions under the multinomial logit model. Production Oper. Management 22(5):1182–1199.Crossref, Google Scholar
• van Ryzin G, Mahajan S (1999) On the relationship between inventory costs and variety benefits in retail assortments. Management Sci. 45(11):1496–1509.Link, Google Scholar
• Vera A, Banerjee S, Gurvich I (2021) Online allocation and pricing: Constant regret via Bellman inequalities. Oper. Res. 69(3):821–840.Link, Google Scholar
• Zhang J, Ma W, Topaloglu H (2025) Leveraging the degree of dynamic substitution in assortment and inventory planning. Oper. Res. 73(3):1248–1259.Link, Google Scholar