Assortment Optimization Under History-Dependent Effects

References

• Adelman D, Mersereau AJ (2013) Dynamic capacity allocation to customers who remember past service. Management Sci. 59(3):592–612.Link, Google Scholar
• Akçakuş İ, Mišić VV (2026) Exact logit-based product design. Management Sci., ePub ahead of print June 9, https://doi.org/10.1287/mnsc.2023.01774.Google Scholar
• Akchen YC, Mišić VV (2025) Assortment optimization under the decision forest model. Preprint, submitted December 16, https://arxiv.org/abs/2103.14067v3.Google Scholar
• Aouad A, Feldman J, Segev D (2023) The exponomial choice model for assortment optimization: An alternative to the MNL model? Management Sci. 69(5):2814–2832.Link, Google Scholar
• Aouad A, Feldman J, Segev D, Zhang DJ (2025) The click-based MNL model: A framework for modeling click data in assortment optimization. Management Sci. 71(8):6943–6960.Link, Google Scholar
• Atamtürk A, Gómez A (2020) Submodularity in conic quadratic mixed 0–1 optimization. Oper. Res. 68(2):609–630.Abstract, Google Scholar
• Atamtürk A, Berenguer G, Shen ZJ (2012) A conic integer programming approach to stochastic joint location-inventory problems. Oper. Res. 60(2):366–381.Link, Google Scholar
• Bastani H, Harsha P, Perakis G, Singhvi D (2022) Learning personalized product recommendations with customer disengagement. Manufacturing Service Oper. Management 24(4):2010–2028.Link, Google Scholar
• Batsell RR, Polking JC (1985) A new class of market share models. Marketing Sci. 4(3):177–198.Link, Google Scholar
• Ben-Tal A, Nemirovski A (2001) Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications (SIAM, Philadelphia).Crossref, Google Scholar
• Bernstein F, Chakraborty S, Swinney R (2022) Intertemporal content variation with customer learning. Manufacturing Service Oper. Management 24(3):1664–1680.Link, Google Scholar
• Bertsimas D, Mišić VV (2019) Exact first-choice product line optimization. Oper. Res. 67(3):651–670.Link, Google Scholar
• Bestuzheva K, Gleixner A, Vigerske S (2023) A computational study of perspective cuts. Math. Programming Comput. 15(4):703–731.Crossref, Google Scholar
• Bestuzheva K, Besançon M, Chen WK, Chmiela A, Donkiewicz T, van Doornmalen J, Eifler L, et al. (2021) The SCIP Optimization Suite 8.0. Accessed March 3, 2024, http://www.optimization-online.org/DB_HTML/2021/12/8728.html.Google Scholar
• Bezanson J, Edelman A, Karpinski S, Shah VB (2017) Julia: A fresh approach to numerical computing. SIAM Rev. 59(1):65–98.Crossref, Google Scholar
• Bi S, Teo CP, Yao D (2026) Sales promotion in collect-and-win games: Duration, assortment and goal gradient effect. Preprint, submitted May 19, https://doi.org/10.2139/ssrn.3546460.Google Scholar
• Bowden JLH (2009) The process of customer engagement: A conceptual framework. J. Marketing Theory Practice 17(1):63–74.Crossref, Google Scholar
• Cao Y, Kleywegt AJ, Wang H (2022) Network revenue management under a spiked multinomial logit choice model. Oper. Res. 70(4):2237–2253.Link, Google Scholar
• Caro F, Martínez-de Albéniz V (2020) Managing online content to build a follower base: Model and applications. INFORMS J. Optim. 2(1):57–77.Link, Google Scholar
• Caro F, Martínez-de Albéniz V, Rusmevichientong P (2014) The assortment packing problem: Multiperiod assortment planning for short-lived products. Management Sci. 60(11):2701–2721.Link, Google Scholar
• Charnes A, Cooper WW (1962) Programming with linear fractional functionals. Naval Res. Logist. Quart. 9(3–4):181–186.Crossref, Google Scholar
• Chen W, He Y, Bansal S (2023b) Customized dynamic pricing when customers develop a habit or satiation. Oper. Res. 71(6):2158–2174.Link, Google Scholar
• Chen L, He L, Zhou Y (2023a) An exponential cone programming approach for managing electric vehicle charging. Oper. Res. 72(5):2215–2240.Link, Google Scholar
• Chen N, Gao P, Wang C, Wang Y (2025) Assortment optimization for the multinomial logit model with repeated customer interactions. Preprint, submitted October 15, https://doi.org/10.2139/ssrn.4526247.Google Scholar
• Chen Y, He T, Rong Y, Wang Y (2026) An integer programming approach for quick-commerce assortment planning. Management Sci., ePub ahead of print February 6, https://doi.org/10.1287/mnsc.2023.02996.Google Scholar
• Chen J, Liang Y, Shen H, Shen ZJM, Xue M (2022) Offline-channel planning in smart omnichannel retailing. Manufacturing Service Oper. Management 24(5):2444–2462.Link, 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, Jagabathula S, Segev D (2021) Mallows-smoothed distribution over rankings approach for modeling choice. Oper. Res. 69(4):1206–1227.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
• Dubé JP, Manchanda P (2005) Differences in dynamic brand competition across markets: An empirical analysis. Marketing Sci. 24(1):81–95.Link, Google Scholar
• Edenred (2024) Do you prefer the same lunch as most of Finns? Accessed March 3, 2024, https://edenred.fi/en/blog/lunch-favourites-of-the-finns.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
• ezCater (2024) The food for work report. Accessed March 3, 2024, https://1703639.fs1.hubspotusercontent-na1.net/hubfs/1703639/ezCater_Food_For_Work_Report_2024.pdf.Google Scholar
• Feldman J, Jiang P (2023) Display optimization under the multinomial logit choice model: Balancing revenue and customer satisfaction. Production Oper. Management 32(11):3374–3393.Crossref, Google Scholar
• Feldman JB, Topaloglu H (2015) Capacity constraints across nests in assortment optimization under the nested logit model. Oper. Res. 63(4):812–822.Link, Google Scholar
• Fooda (2024) Fooda cafeteria solutions is the future of corporate dining. Accessed March 3, 2024, https://www.fooda.com/cafeteria-solutions-corporate-dining.Google Scholar
• Fox RJ, Reddy SK, Rao B (1997) Modeling response to repetitive promotional stimuli. J. Acad. Marketing Sci. 25(3):242–255.Crossref, Google Scholar
• Gao P, Ma Y, Chen N, Gallego G, Li A, Rusmevichientong P, Topaloglu H (2021) Assortment optimization and pricing under the multinomial logit model with impatient customers: Sequential recommendation and selection. Oper. Res. 69(5):1509–1532.Link, Google Scholar
• Guadagni PM, Little JD (1983) A logit model of brand choice calibrated on scanner data. Marketing Sci. 2(3):203–238.Link, Google Scholar
• Günlük O, Linderoth J (2010) Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Programming 124:183–205.Crossref, Google Scholar
• Gürlek R, Baucells M, Osadchiy N (2025) Optimal design and pricing of sequenced bundles in the presence of satiation. Preprint, submitted June 3, https://doi.org/10.2139/ssrn.4648305.Google Scholar
• Gurobi Optimization, LLC (2023) Gurobi optimizer reference manual. Accessed March 3, 2024, https://www.gurobi.com.Google Scholar
• He T, Tawarmalani M (2026) Discreteness to convexity: Promotion planning via simplotope triangulation. Preprint, submitted January 27, https://arxiv.org/abs/2408.04562v3.Google Scholar
• He T, Liu S, Tawarmalani M (2024) Convexification techniques for fractional programs. Math. Programming 213(1–2):107–149.Google Scholar
• He L, Li X, Zhao Y (2026) Proactive policing: Resource allocation for crime prevention with deterrence effect. Oper. Res. 74(2):700–721.Link, Google Scholar
• Jasin S, Lyu C, Najafi S, Zhang H (2024) Assortment optimization with multi-item basket purchase under multivariate MNL model. Manufacturing Service Oper. Management 26(1):215–232.Link, Google Scholar
• Kanoria Y, Lobel I, Lu J (2024) Managing customer churn via service mode control. Math. OR 49(2):1192–1222.Link, Google Scholar
• Karp RM (1978) A characterization of the minimum cycle mean in a digraph. Discrete Math. 23(3):309–311.Crossref, Google Scholar
• Khajavirad A (2023) On the strength of recursive McCormick relaxations for binary polynomial optimization. Oper. Res. Lett. 51(2):146–152.Crossref, Google Scholar
• Kılınç-Karzan F, Küçükyavuz S, Lee D, Shafieezadeh-Abadeh S (2023) Conic mixed-binary sets: Convex hull characterizations and applications. Oper. Res. 73(1):251–269.Link, Google Scholar
• Kong Q, Lee CY, Teo CP, Zheng Z (2013) Scheduling arrivals to a stochastic service delivery system using copositive cones. Oper. Res. 61(3):711–726.Link, Google Scholar
• Lei X, Wan B, Wang S (2025) Content rotation in the presence of satiation effects. Preprint, submitted August 26, https://doi.org/10.2139/ssrn.4593945.Google Scholar
• Lemon KN, Verhoef PC (2016) Understanding customer experience throughout the customer journey. J. Marketing 80(6):69–96.Crossref, Google Scholar
• Li X, Lin H, Liu F (2024) Should only popular products be stocked? Warehouse assortment selection for e-commerce companies. Manufacturing Service Oper. Management 26(4):1372–1386.Link, Google Scholar
• Liu Y, Cooper WL (2015) Optimal dynamic pricing with patient customers. Oper. Res. 63(6):1307–1319.Link, Google Scholar
• Liu Q, Van Ryzin G (2008) On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management 10(2):288–310.Link, Google Scholar
• Liu N, Ma Y, Topaloglu H (2020) Assortment optimization under the multinomial logit model with sequential offerings. INFORMS J. Comput. 32(3):835–853.Link, Google Scholar
• Lovász L (1983) Submodular functions and convexity. Bachem A, Korte B, eds. Mathematical Programming the State of the Art: Bonn 1982 (Springer, Berlin), 235–257.Crossref, Google Scholar
• Luan S, Wang R, Xu X, Xue W (2025) Joint assortment and price optimization with multiple purchases. Production Oper. Management 34(2):187–204.Crossref, Google Scholar
• Lubin M, Dowson O, Garcia JD, Huchette J, Legat B, Vielma JP (2023) JuMP 1.0: Recent improvements to a modeling language for mathematical optimization. Math. Programming Comput. 15(3):581–589.Crossref, Google Scholar
• Mak HY, Rong Y, Shen ZJM (2013) Infrastructure planning for electric vehicles with battery swapping. Management Sci. 59(7):1557–1575.Link, Google Scholar
• Martínez-de Albéniz V, Planas A, Nasini S (2020) Using clickstream data to improve flash sales effectiveness. Production Oper. Management 29(11):2508–2531.Crossref, Google Scholar
• McCormick GP (1976) Computability of global solutions to factorable nonconvex programs: Part I—Convex underestimating problems. Math. Programming 10(1):147–175.Crossref, Google Scholar
• McFadden D (1974) Conditional logit analysis of qualitative choice behavior. Zarembka P, ed. Frontiers in Econometrics (Academic Press, New York), 105–142.Google Scholar
• Mehmanchi E, Gómez A, Prokopyev OA (2019) Fractional 0–1 programs: Links between mixed-integer linear and conic quadratic formulations. J. Global Optim. 75(2):273–339.Crossref, Google Scholar
• Mehta N (2007) Investigating consumers’ purchase incidence and brand choice decisions across multiple product categories: A theoretical and empirical analysis. Marketing Sci. 26(2):196–217.Link, Google Scholar
• MOSEK (2024) The MOSEK optimization toolbox for Julia manual. Version 10.2. Accessed March 3, 2024, https://docs.mosek.com/10.2/juliaapi/index.html.Google Scholar
• O’Donnell R (2014) Analysis of Boolean Functions (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Popescu I, Wu Y (2007) Dynamic pricing strategies with reference effects. Oper. Res. 55(3):413–429.Link, Google Scholar
• Rhoades SA (1993) The Herfindahl-Hirschman index. Federal Reserve Bull. 79(3):188–189.Google Scholar
• Rockafellar RT (1970) Convex Analysis, vol. 28 (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Sen A, Atamtürk A, Kaminsky P (2018) A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model. Oper. Res. 66(4):994–1003.Link, Google Scholar
• Simchi-Levi D, Wei Y (2012) Understanding the performance of the long chain and sparse designs in process flexibility. Oper. Res. 60(5):1125–1141.Link, Google Scholar
• Simchi-Levi D, Wang H, Wei Y (2019) Constraint generation for two-stage robust network flow problems. INFORMS J. Optim. 1(1):49–70.Link, Google Scholar
• Şimşek AS, Topaloglu H (2018) An expectation-maximization algorithm to estimate the parameters of the Markov chain choice model. Oper. Res. 66(3):748–760.Link, Google Scholar
• Sumida M, Zhou A (2023) Optimizing and learning assortment decisions in the presence of platform disengagement. Preprint, submitted August 14, https://doi.org/10.2139/ssrn.4537925.Google Scholar
• Talluri K, Van Ryzin G (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1):15–33.Link, Google Scholar
• Tawarmalani M, Sahinidis NV (2002) Convex extensions and envelopes of lower semi-continuous functions. Math. Programming 93(2):247–263.Crossref, Google Scholar
• Tawarmalani M, Sahinidis NV (2005) A polyhedral branch-and-cut approach to global optimization. Math. Programming 103(2):225–249.Crossref, Google Scholar
• Tawarmalani M, Richard JPP, Xiong C (2013) Explicit convex and concave envelopes through polyhedral subdivisions. Math. Programming 138(1–2):531–577.Crossref, Google Scholar
• van Ryzin G, Vulcano G (2017) An expectation-maximization method to estimate a rank-based choice model of demand. Oper. Res. 65(2):396–407.Link, Google Scholar
• Van Wezel W, Van Donk DP, Gaalman G (2006) The planning flexibility bottleneck in food processing industries. J. Oper. Management 24(3):287–300.Crossref, Google Scholar
• Vielma JP (2015) Mixed integer linear programming formulation techniques. SIAM Rev. 57(1):3–57.Crossref, Google Scholar
• Vilcassim NJ, Kadiyali V, Chintagunta PK (1999) Investigating dynamic multifirm market interactions in price and advertising. Management Sci. 45(4):499–518.Link, Google Scholar
• Wang R (2018) When prospect theory meets consumer choice models: Assortment and pricing management with reference prices. Manufacturing Service Oper. Management 20(3):583–600.Link, Google Scholar
• Wang R, Wang Z (2017) Consumer choice models with endogenous network effects. Management Sci. 63(11):3944–3960.Link, Google Scholar
• Wang Y, You F, Vossen T, Zhang R (2026) Assortment optimization for online video games. Preprint, submitted November 18, https://doi.org/10.2139/ssrn.5769002.Google Scholar
• Xie T, Wang Z (2024) Personalized assortment optimization under consumer choice models with local network effects. Oper. Res. 73(3):1289–1306.Link, Google Scholar
• Xu Y, Wang Z (2023) Assortment optimization for a multistage choice model. Manufacturing Service Oper. Management 25(5):1748–1764.Link, Google Scholar
• Yan Z, Gao SY, Teo CP (2018) On the design of sparse but efficient structures in operations. Management Sci. 64(7):3421–3445.Link, Google Scholar