Technical Note—Assortment Optimization with Small Consideration Sets

References

• Alimonti P, Kahn, V (2000) Some APX-completeness results for cubic graphs. Theoret. Comput. 237(1):123–134.Crossref, Google Scholar
• Aouad A, Farias VF, Levi R (2015a) Assortment optimization under consider-then-choose choice models. Working paper, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Aouad A, Farias VF, Levi R, Segev D (2015b) The approximability of assortment optimization under ranking preferences. Working paper, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Bertsimas D, Mišić V (2017) Exact first-choice product line optimization. Working paper, MIT Sloan School, Cambridge, MA.Crossref, 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
• Crompton JL, Ankomah PK (1993) Choice set propositions in destination decisions. Ann. Tourism Res. 20(3):461–476.Crossref, Google Scholar
• Davis JM, Gallego G, Topaloglu H (2013) Assortment planning under the multinomial logit model with totally unimodular constraint structures. Working paper, Department of IEOR, Columbia University, New York.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 (2014) Near-optimal for capacity constrained assortment optimization. Working paper, Columbia University, New York.Google Scholar
• Désir A, Goyal V, Segev D, Ye C (2015) Capacity constrained assortment optimization under the Markov chain based choice model. Working paper, Columbia University, New York.Google Scholar
• Erdõs P, Selfridge JL (1973) On a combinatorial game. J. Combin. Theory B 14(3):293–301.Google Scholar
• Feldman J, Topaloglu H (2015) Capacity constraints across nests in assortment optimization under the nested logit model. Oper. Res. 63(4):812–822.Link, Google Scholar
• Feldman J, Topaloglu H (2018) Revenue management under the Markov chain choice model. Oper. Res. 65(5):1322–1342.Link, Google Scholar
• Gallego G, Topaloglu H (2014) Constrained assortment optimization for the nested logit model. Management Sci. 60(10):2583–2601.Link, Google Scholar
• Hauser J, Ding M, Gaskin SP (2009) Non-compensatory (and compensatory) models of consideration-set decisions. 2009 Sawtooth Software Conf. Proc., Sequin, WA, 207–232.Google Scholar
• Hochbaum DS, Megiddo N, Naor J, Tamir A (1993) Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Math. Programming 62(1):69–83.Crossref, Google Scholar
• Honhon D, Jonnalagedda S, Pan XA (2012) Optimal algorithms for assortment selection under ranking-based consumer choice models. Manufacturing Service Oper. Management 14(2):279–289.Link, Google Scholar
• Jagabathula S, Rusmevichientong P (2016) A nonparametric joint assortment and price choice model. Management Sci. 63(9):3128–3145.Link, Google Scholar
• Jeuland AP (1979) Brand choice inertia as one aspect of the notion of brand loyalty. Management Sci. 25(7):671–682.Link, 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
• Lapersonne E, Laurent G, Le Goff J-J (1995) Consideration sets of size one: An empirical investigation of automobile purchases. Internat. J. Res. Marketing 49(1):55–66.Crossref, Google Scholar
• Lewin M, Livnat D, Zwick U (2002) Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. Cook WJ, Schulz AS, eds. Internat. Conf. Integer Programming Combin. Optim. (IPCO 2002), Lecture Notes in Computer Science, vol. 2337 (Springer, Berlin), pp. 67–82.Crossref, Google Scholar
• Li G, Rusmevichientong P (2014) A greedy algorithm for the two-level nested logit model. Oper. Res. Lett. 42(5):319–324.Crossref, Google Scholar
• Li G, Rusmevichientong P, Topaloglu H (2015) The d-level nested logit model: Assortment and price optimization problems. Oper. Res. 63(2):325–342.Link, Google Scholar
• Mahajan S, Ramesh H (1999) Derandomizing approximation algorithms based on semidefinite programming. SIAM J. Comput. 28(5):1641–1663.Crossref, Google Scholar
• Mahajan S, van Ryzin G (2001a) Inventory competition under dynamic consumer choice. Oper. Res. 49(5):646–657.Link, Google Scholar
• Mahajan S, van Ryzin G (2001b) Stocking retail assortment under dynamic consumer substitution. Oper. Res. 49(3):334–351.Link, Google Scholar
• Meissner J, Strauss A, Talluri K (2013) Enhanced concave program relaxation for choice network revenue management. Production Oper. Management 22(1):71–87.Crossref, Google Scholar
• Méndez-Díaz I, Miranda-Bront JJ, Vulcano G, Zabala P (2014) A branch-and-cut algorithm for the latent-class logit assortment problem. Discrete Appl. Math. 164(Part 1):246–263.Crossref, Google Scholar
• Nemhauser GL, Trotter LE (1975) Vertex packings: Structural properties and algorithms. Math. Programming 8(1):232–248.Crossref, Google Scholar
• Paul A, Feldman J, Davis J (2018) Assortment optimization and pricing under a nonparametric tree choice model. Manufacturing Service Oper. Management 20(3):550–565.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
• Spencer JH (1987) Ten Lectures on the Probabilistic Method, vol. 52 (Society for Industrial and Applied Mathematics, Philadelphia).Google Scholar
• Talluri K (2014) New formulations for choice network revenue management. INFORMS J. Comput. 26(2):401–413.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
• Train K (2009) Discrete Choice Models with Simulation (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• van Ryzin G, Vulcano G (2015) A market discovery algorithm to estimate a general class of nonparametric choice models. Management Sci. 61(2):281–300.Link, Google Scholar
• Wang R (2012) Capacitated assortment and price optimization under the multinomial logit model. Oper. Res. Lett. 40(6):492–497.Crossref, Google Scholar
• Wang R (2013) Assortment management under the generalized attraction model with a capacity constraint. J. Revenue Pricing Management 12(3):254–270.Crossref, Google Scholar