IDEAS home Printed from https://ideas.repec.org/r/inm/ormnsc/v52y2006i3p435-447.html

Conjoint Optimization: An Exact Branch-and-Bound Algorithm for the Share-of-Choice Problem

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Alan T. Murray, 2016. "Maximal Coverage Location Problem," International Regional Science Review, , vol. 39(1), pages 5-27, January.
  2. Julio López & Sebastián Maldonado & Ricardo Montoya, 2017. "Simultaneous preference estimation and heterogeneity control for choice-based conjoint via support vector machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1323-1334, November.
  3. James Agarwal & Wayne DeSarbo & Naresh K. Malhotra & Vithala Rao, 2015. "An Interdisciplinary Review of Research in Conjoint Analysis: Recent Developments and Directions for Future Research," Customer Needs and Solutions, Springer;Institute for Sustainable Innovation and Growth (iSIG), vol. 2(1), pages 19-40, March.
  4. Xinfang (Jocelyn) Wang & Jeffrey D. Camm & David J. Curry, 2009. "A Branch-and-Price Approach to the Share-of-Choice Product Line Design Problem," Management Science, INFORMS, vol. 55(10), pages 1718-1728, October.
  5. Maldonado, Sebastián & Montoya, Ricardo & Weber, Richard, 2015. "Advanced conjoint analysis using feature selection via support vector machines," European Journal of Operational Research, Elsevier, vol. 241(2), pages 564-574.
  6. Joey Huchette & Juan Pablo Vielma, 2023. "Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools," Operations Research, INFORMS, vol. 71(5), pages 1835-1856, September.
  7. Dong, Songting & Ding, Min & Huber, Joel, 2010. "A simple mechanism to incentive-align conjoint experiments," International Journal of Research in Marketing, Elsevier, vol. 27(1), pages 25-32.
  8. James Cochran & David Curry & Rajesh Radhakrishnan & Jon Pinnell, 2014. "Political engineering: optimizing a U.S. Presidential candidate’s platform," Annals of Operations Research, Springer, vol. 215(1), pages 63-87, April.
  9. Maoqi Liu & Li Zheng & Changchun Liu & Zhi‐Hai Zhang, 2023. "From share of choice to buyers' welfare maximization: Bridging the gap through distributionally robust optimization," Production and Operations Management, Production and Operations Management Society, vol. 32(4), pages 1205-1222, April.
  10. Daniel Baier & Sascha Voekler, 2024. "One-stage product-line design heuristics: an empirical comparison," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(1), pages 73-107, March.
  11. Alexandre Belloni & Robert Freund & Matthew Selove & Duncan Simester, 2008. "Optimizing Product Line Designs: Efficient Methods and Comparisons," Management Science, INFORMS, vol. 54(9), pages 1544-1552, September.
  12. Wang, Xinfang (Jocelyn) & Curry, David J., 2012. "A robust approach to the share-of-choice product design problem," Omega, Elsevier, vol. 40(6), pages 818-826.
  13. Tsafarakis, Stelios & Zervoudakis, Konstantinos & Andronikidis, Andreas & Altsitsiadis, Efthymios, 2020. "Fuzzy self-tuning differential evolution for optimal product line design," European Journal of Operational Research, Elsevier, vol. 287(3), pages 1161-1169.
  14. Ronny Baierl, 2018. "Understanding Entrepreneurial Team Decisions: Measuring Team Members’ Influences With The Metricized Limit Conjoint Analysis," SAGE Open, , vol. 8(2), pages 21582440187, May.
  15. Tsafarakis, Stelios & Marinakis, Yannis & Matsatsinis, Nikolaos, 2011. "Particle swarm optimization for optimal product line design," International Journal of Research in Marketing, Elsevier, vol. 28(1), pages 13-22.
  16. Choi, Hyunhong & Koo, Yoonmo, 2023. "New technology product introduction strategy with considerations for consumer-targeted policy intervention and new market entrant," Technological Forecasting and Social Change, Elsevier, vol. 186(PA).
  17. Schön, Cornelia, 2010. "On the product line selection problem under attraction choice models of consumer behavior," European Journal of Operational Research, Elsevier, vol. 206(1), pages 260-264, October.
  18. Bochuan Lyu & Illya V. Hicks & Joey Huchette, 2026. "Building Formulations for Piecewise Linear Relaxations of Nonlinear Functions," Operations Research, INFORMS, vol. 74(1), pages 484-499, January.
  19. Emmanuel Fragnière & Roman Kanala & Francesco Moresino & Adriana Reveiu & Ion Smeureanu, 2017. "Coupling techno-economic energy models with behavioral approaches," Operational Research, Springer, vol. 17(2), pages 633-647, July.
  20. Tan Wang & Genaro Gutierrez, 2022. "Robust Product Line Design by Protecting the Downside While Minding the Upside," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 194-217, January.
  21. YiChun Miriam Liu & Jeff D. Brazell & Greg M. Allenby, 2022. "Non-linear pricing effects in conjoint analysis," Quantitative Marketing and Economics (QME), Springer, vol. 20(4), pages 397-430, December.
  22. Francesco Moresino, 2021. "A Robust Share-of-Choice Model," Mathematics, MDPI, vol. 9(3), pages 1-10, February.
  23. Hein, Maren & Goeken, Nils & Kurz, Peter & Steiner, Winfried J., 2022. "Using Hierarchical Bayes draws for improving shares of choice predictions in conjoint simulations: A study based on conjoint choice data," European Journal of Operational Research, Elsevier, vol. 297(2), pages 630-651.
  24. Furrer, Olivier & Sudharshan, Devanathan & Tsiotsou, Rodoula H. & Liu, Ben S., 2016. "A framework for innovative service design," FSES Working Papers 476, Faculty of Economics and Social Sciences, University of Freiburg/Fribourg Switzerland.
  25. Zhiqiao Wu & C.K. Kwong & C.K.M. Lee & Jiafu Tang, 2016. "Joint decision of product configuration and remanufacturing for product family design," International Journal of Production Research, Taylor & Francis Journals, vol. 54(15), pages 4689-4702, August.
  26. James J. Cochran & Martin S. Levy & Jeffrey D. Camm, 2010. "Bayesian coverage optimization models," Journal of Combinatorial Optimization, Springer, vol. 19(2), pages 158-173, February.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.