Tractable Approximations for Assortment Planning with Product Costs

References

• Anderson SP, De Palma A, Thisse J (1992) Discrete Choice Theory of Product Differentiation (MIT Press, Cambridge, MA).Crossref, Google Scholar
• Atamtürk A, Gómez A (2017) Maximizing a class of utility functions over the vertices of a polytope. Oper. Res. 65(2):433–445.Link, Google Scholar
• Bertsimas D, Tsitsiklis JN (1997) Introduction to Linear Optimization, vol. 6 (Athena Scientific, Belmont, MA).Google Scholar
• Caro F, Martínez-de Albéniz V (2015) Fast fashion: Business model overview and research opportunities. Agrawal N, Smith SA, eds. Retail Supply Chain Management: Quantitative Models and Empirical Studies, 2nd ed. (Springer, New York), 237–264.Google Scholar
• Davis JM, Gallego G, Topaloglu H (2013) Assortment planning under the multinomial logit model with totally unimodular constraint structures. Working paper, Cornell University, Ithaca, NY.Google Scholar
• Davis JM, Gallego G, Topaloglu H (2014) Assortment optimization under variants of the nested logit model. Oper. Res. 62(2):250–273.Link, Google Scholar
• Feldman J, Paul A (2017) Relating the approximability of the fixed cost and space constrained assortment problems. Working paper, Washington University, St. Louis.Crossref, Google Scholar
• Feldman JB, Topaloglu H (2015) Bounding optimal expected revenues for assortment optimization under mixtures of multinomial logits. Production Oper. Management 24(10):1513–1674.Crossref, Google Scholar
• Gallego G, Topaloglu H (2014) Constrained assortment optimization for the nested logit model. Management Sci. 60(10):2583–2601.Link, Google Scholar
• Kök AG, Fisher ML, Vaidyanathan R (2009) Assortment planning: Review of literature and industry practice. Agrawal N, Smith SA, eds. Retail Supply Chain Management: Quantitative Models and Empirical Studies, International Series in Operations Research & Management Science (Springer, New York), 99–153.Google Scholar
• Kunnumkal S (2015) On upper bounds for assortment optimization under the mixture of multinomial logit models. Oper. Res. Lett. 43(2):189–194.Crossref, Google Scholar
• Kunnumkal S, Topaloglu H (2008) A refined deterministic linear program for the network revenue management problem with customer choice behavior. Naval Res. Logist. Quart. 55(6):563–580.Crossref, Google Scholar
• Kunnumkal S, Rusmevichientong P, Topaloglu H (2009) Assortment optimization under the multinomial logit model with product costs. Technical report, accessed January 30, 2018, http://web.business.queensu.ca/faculty/skunnumkal/docs/logit_cost_jan62010.pdf.Google Scholar
• Miranda Bront JJ, Méndez-Díaz I, Vulcano G (2009) A column generation algorithm for choice-based network revenue management. Oper. Res. 57(3):769–784.Link, Google Scholar
• Rusmevichientong P, Shen Z-JM, Shmoys DB (2010) Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6):1666–1680.Link, Google Scholar
• Rusmevichientong P, Shmoys DB, Tong C, Topaloglu H (2014) Assortment optimization under the multinomial logit model with random choice parameters. Production Oper. Management 23(11):2023–2039.Crossref, Google Scholar
• Schön C (2010) Optimal dynamic price selection under attraction choice models. Eur. J. Oper. Res. 205(3):650–660.Crossref, Google Scholar
• Talluri K, van Ryzin GJ (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1):15–33.Link, 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 GJ, Mahajan S (1999) On the relationship between inventory costs and variety benefits in retail assortments. Management Sci. 45(11):1496–1509.Link, Google Scholar
• Vazirani VV (2013) Approximation Algorithms (Springer Science & Business Media, New York).Google Scholar