Exact First-Choice Product Line Optimization

References

• Aouad A, Farias VF, Levi R (2015) Assortment optimization under consider-then-choose choice models Working paper, London Business School, London.Google Scholar
• Aouad A, Farias VF, Levi R, Segev D (2017) The approximability of assortment optimization under ranking preferences. Oper. Res. 66(6):1661–1669.Link, Google Scholar
• Belloni A, Freund R, Selove M, Simester D (2008) Optimizing product line designs: Efficient methods and comparisons. Management Sci. 54(9):1544–1552.Link, Google Scholar
• Bertsimas D, Mišić VV (2017) Robust product line design. Oper. Res. 65(1):19–37.Link, Google Scholar
• Bertsimas D, Tsitsiklis JN (1997) Introduction to Linear Optimization (Athena Scientific, Belmont, MA).Google Scholar
• Bertsimas D, Weismantel R (2005) Optimization Over Integers (Dynamic Ideas, Belmont, MA).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
• 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
• Chen KD, Hausman WH (2000) Technical note: Mathematical properties of the optimal product line selection problem using choice-based conjoint analysis. Management Sci. 46(2):327–332.Link, Google Scholar
• Contreras I, Cordeau J-F, Laporte G (2011) Benders decomposition for large-scale uncapacitated hub location. Oper. Res. 59(6):1477–1490.Link, Google Scholar
• Cordeau J-F, Stojković G, Soumis F, Desrosiers J (2001) Benders decomposition for simultaneous aircraft routing and crew scheduling. Transportation Sci. 35(4):375–388.Link, 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
• Dobson G, Kalish S (1988) Positioning and pricing a product line. Marketing Sci. 7(2):107–125.Link, Google Scholar
• Dunning I, Huchette J, Lubin M (2017) JuMP: A modeling language for mathematical optimization. SIAM Rev. 59(2):295–320.Crossref, Google Scholar
• Farias VF, Jagabathula S, Shah D (2013) A nonparametric approach to modeling choice with limited data. Management Sci. 59(2):305–322.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
• Geoffrion AM, Graves GW (1974) Multicommodity distribution system design by benders decomposition. Management Sci. 20(5):822–844.Link, Google Scholar
• Green PE, Krieger AM (1985) Models and heuristics for product line selection. Marketing Sci. 4(1):1–19.Link, Google Scholar
• Green PE, Krieger AM (1993) Conjoint analysis with product-positioning applications. Eliashberg J, Lilien GL, eds. Handbooks in Operations Research and Management Science, vol. 5 (Elsevier, Amsterdam), 467–515.Google Scholar
• Gurobi Optimization, Inc. (2017) Gurobi Optimizer Reference Manual (Gurobi Optimization, Inc., Beaverton, Oregon).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
• Kohli R, Jedidi K (2015) Error theory for elimination by aspects. Oper. Res. 63(3):512–526.Link, Google Scholar
• Kohli R, Krishnamurti R (1987) A heuristic approach to product design. Management Sci. 33(12):1523–1533.Link, Google Scholar
• Kohli R, Krishnamurti R (1989) Optimal product design using conjoint analysis: Computational complexity and algorithms. Eur. J. Oper. Res. 40(2):186–195.Crossref, Google Scholar
• Kohli R, Sukumar R (1990) Heuristics for product-line design using conjoint analysis. Management Sci. 36(12):1464–1478.Link, Google Scholar
• Kohli R., Boughanmi K., Kohli V (2019) Randomized algorithms for lexicographic inference. Oper. Res. 67(2):357–375.Abstract, Google Scholar
• Kraus UG, Yano CA (2003) Product line selection and pricing under a share-of-surplus choice model. Eur. J. Oper. Res. 150(3):653–671.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
• Lubin M, Dunning I (2015) Computing in operations research using Julia. INFORMS J. Comput. 27(2):238–248.Link, Google Scholar
• Luo L (2011) Product line design for consumer durables: An integrated marketing and engineering approach. J. Marketing Res. 48(1):128–139.Crossref, Google Scholar
• McBride RD, Zufryden FS (1988) An integer programming approach to the optimal product line selection problem. Marketing Sci. 7(2):126–140.Link, Google Scholar
• Mišić VV (2016) Data, models and decisions for large-scale stochastic optimization problems. Doctoral thesis, Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
• Nemhauser GL, Wolsey LA (1988) Integer and Combinatorial Optimization (Wiley Interscience, New York).Crossref, Google Scholar
• Rahmaniani R, Crainic TG, Gendreau M, Rei W (2017) The benders decomposition algorithm: A literature review. Eur. J. Oper. Res. 259(3):801–817.Crossref, Google Scholar
• Rusmevichientong P, Topaloglu H (2012) Robust assortment optimization in revenue management under the multinomial logit choice model. Oper. Res. 60(4):865–882.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
• Schön C (2010a) On the optimal product line selection problem with price discrimination. Management Sci. 56(5):896–902.Link, Google Scholar
• Schön C (2010b) On the product line selection problem under attraction choice models of consumer behavior. Eur. J. Oper. Res. 206(1):260–264.Crossref, 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
• Toubia O, Simester DI, Hauser JR, Dahan E (2003) Fast polyhedral adaptive conjoint estimation. Marketing Sci. 22(3):273–303.Link, Google Scholar
• Toubia O, Hauser JR, Simester DI (2004) Polyhedral methods for adaptive choice-based conjoint analysis. J. Marketing Res. 41(1):116–131.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
• Yee M, Dahan E, Hauser JR, Orlin J (2007) Greedoid-based noncompensatory inference. Marketing Sci. 26(4):532–549.Link, Google Scholar