An Integer Programming Approach for Quick-Commerce Assortment Planning

References

• Avadhanula V, Bhandari J, Goyal V, Zeevi A (2016) On the tightness of an LP relaxation for rational optimization and its applications. Oper. Res. Lett. 44(5):612–617.Crossref, Google Scholar
• Balas E (1998) Disjunctive programming: Properties of the convex hull of feasible points. Discrete Appl. Math. 89(1–3):3–44.Crossref, Google Scholar
• Berge C (1972) Balanced matrices. Math. Programming 2:19–31. Crossref, Google Scholar
• Bertsimas D, Misić VV (2019) Exact first-choice product line optimization. Oper. Res. 67(3):651–670.Link, Google Scholar
• Bertsimas D, Tsitsiklis JN (1997) Introduction to Linear Optimization, Athena Scientific Series in Optimization and Neural Computation, vol. 6 (Athena Scientific, Belmont, MA).Google Scholar
• Bertsimas D, Weismantel R (2005) Optimization over Integers (Dynamic Ideas, Belmont, MA).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
• Bront JJM, 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
• Cao Y, Rusmevichientong P, Topaloglu H (2023) Revenue management under a mixture of independent demand and multinomial logit models. Oper. Res. 71(2):603–625.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 YC, Misić VV (2021) Assortment optimization under the decision forest model. Preprint, submitted March 25, https://arxiv.org/abs/2103.14067. Google Scholar
• Chen R, Jiang B, Ryan CT, Zhang N (2025) Assortment optimization with α-similar substitutes: Insights from customer browsing patterns. Management Sci., ePub ahead of print November 24, https://doi.org/10.1287/mnsc.2023.00786.Link, 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
• Conforti M, Cornuéjols G, Rao MR (1999) Decomposition of balanced matrices. J. Combin. Theory Ser. B. 77(2):292–406.Crossref, Google Scholar
• Conforti M, Cornuéjols G, Zambelli G (2014) Integer Programming, Graduate Texts in Mathematics, vol. 271 (Springer, Cham, Switzerland).Crossref, 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
• Désir A, Goyal V, Zhang J (2022) Capacitated assortment optimization: Hardness and approximation. Oper. Res. 70(2):893–904.Link, Google Scholar
• Dolan ED, Moré JJ (2002) Benchmarking optimization software with performance profiles. Math. Programming 91(2):201–213.Crossref, Google Scholar
• Dzyabura D, Jagabathula S (2018) Offline assortment optimization in the presence of an online channel. Management Sci. 64(6):2767–2786.Link, Google Scholar
• Echenique F, Saito K (2019) General Luce model. Econom. Theory 68(4):811–826.Crossref, Google Scholar
• Echenique F, Saito K, Tserenjigmid G (2018) The perception-adjusted Luce model. Math. Soc. Sci. 93:67–76.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
• Elmachtoub AN, Gupta V, Hamilton ML (2021) The value of personalized pricing. Management Sci. 67(10):6055–6070.Link, Google Scholar
• Fampa M, Lee J (2021) Convexification of bilinear forms through non-symmetric lifting. J. Global Optim. 80:287–305.Crossref, Google Scholar
• Fawzi H, Gouveia J, Parrilo PA, Saunderson J, Thomas RR (2022) Lifting for simplicity: Concise descriptions of convex sets. SIAM Rev. 64(4):866–918.Crossref, Google Scholar
• Flores A, Berbeglia G, Van Hentenryck P (2017) Assortment and price optimization under the two-stage Luce model. Preprint, submitted June 26, https://arxiv.org/abs/1706.08599.Google Scholar
• Gallego G, Li A (2024) A random consideration set model for demand estimation, assortment optimization, and pricing. Oper. Res. 72(6):2358–2374.Link, Google Scholar
• Gallego G, Topaloglu H (2019) Revenue Management and Pricing Analytics, International Series in Operations Research & Management Science, vol. 279 (Springer, New York).Crossref, Google Scholar
• Gallego G, Iyengar G, Phillips R, Dubey A (2004) Managing flexible products on a network. Technical report, Department of Industrial Engineering and Operations Research, Columbia University, New York. Google Scholar
• Ghuge R, Kwon J, Nagarajan V, Sharma A (2022) Constrained assortment optimization under the paired combinatorial logit model. Oper. Res. 70(2):786–804.Link, Google Scholar
• Grötschel M, Lovász L, Schrijver A (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1:169–197.Crossref, Google Scholar
• Gupte A, Ahmed S, Cheon MS, Dey S (2013) Solving mixed integer bilinear problems using MILP formulations. SIAM J. Optim. 23(2):721–744.Crossref, Google Scholar
• Gupte A, Kalinowski T, Rigterink F, Waterer H (2020) Extended formulations for convex hulls of some bilinear functions. Discrete Optim. 36:100569.Crossref, Google Scholar
• Gurobi Optimization, LLC (2025) Gurobi Optimizer reference manual. 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.04562.Google Scholar
• Housni OE, Feng Q, Topaloglu H (2024) Assortment optimization under the multinomial logit model with covering constraints. Preprint, submitted November 15, https://arxiv.org/abs/2411.10310.Google Scholar
• Kelley JE Jr (1960) The cutting-plane method for solving convex programs. J. Soc. Indust. Appl. Math. 8(4):703–712.Crossref, Google Scholar
• Kovach M, Tserenjigmid G (2022) The focal Luce model. Amer. Econom. J.: Microeconomics 14(3):378–413.Crossref, Google Scholar
• Lin H, Li X, Wu L (2026) Intra-category multi-choice preferences learning and assortment recommendation in e-commerce. Production Oper. Management 35(1):304–330. Crossref, Google Scholar
• Lo V, Topaloglu H (2022) Omnichannel assortment optimization under the multinomial logit model with a features tree. Manufacturing Service Oper. Management 24(2):1220–1240.Link, Google Scholar
• Luce RD (1959) Individual Choice Behavior: A Theoretical Analysis (Courier Corporation, Lowell, MA).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 (1978) Modelling the choice of residential location. Snikers F, Karlquist A, Lundquist L, Weibull J, eds. Spatial Interaction Theory and Planning Models (North–Holland, Amsterdam), 75–96.Google Scholar
• Megiddo N (1979) Combinatorial optimization with rational objective functions. Math. Oper. Res. 4(4):414–424.Link, Google Scholar
• Rusmevichientong P, Shmoys D, 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
• Schrijver A (2003) Combinatorial Optimization: Polyhedra and Efficiency, Algorithms and Combinatorics, vol. 24 (Springer, Berlin).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
• Stanley RP (1986) Two poset polytopes. Discrete Comput. Geometry 1(1):9–23.Crossref, Google Scholar
• Statista (2024) Quick Commerce—Worldwide. https://www.statista.com/outlook/emo/online-food-delivery/grocery-delivery/quick-commerce/worldwide.Google Scholar
• Sumida M, Gallego G, Rusmevichientong P, Topaloglu H, Davis J (2021) Revenue-utility tradeoff in assortment optimization under the multinomial logit model with totally unimodular constraints. Management Sci. 67(5):2845–2869.Link, 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 (2024) New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions. Preprint, submitted May 17, https://arxiv.org/abs/2405.11068.Google Scholar
• Tawarmalani M, Richard JPP, Chung K (2010) Strong valid inequalities for orthogonal disjunctions and bilinear covering sets. Math. Programming 124(1–2):481–512.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
• Teo CP, Sethuraman J (1998) The geometry of fractional stable matchings and its applications. Math. Oper. Res. 23(4):874–891.Link, Google Scholar
• Tserenjigmid G (2021) The order-dependent Luce model. Management Sci. 67(11):6915–6933.Link, Google Scholar
• Udwani R (2023) Submodular order functions and assortment optimization. Krause A, Brunskill E, Cho K, Engelhardt B, Sabato S, Scarlett J, eds. Proc. 40th Internat. Conf. Machine Learn., Proceedings of Machine Learning Research, vol. 202 (JMLR.org), 34584–34614.Google Scholar
• van Ryzin GJ (2005) Future of revenue management: Models of demand. J. Revenue Pricing Management 4(2):204–210.Crossref, Google Scholar
• Vielma JP (2015) Mixed integer linear programming formulation techniques. SIAM Rev. 57(1):3–57.Crossref, 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