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

DOI10.1287/mnsc.1050.0461zbMath1232.91419OpenAlexW2160887143MaRDI QIDQ3115965

James J. Cochran, David J. Curry, Jeffrey D. Camm, Sriram Kannan

Publication date: 21 February 2012

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.1050.0461

zbMATH Keywords

integer programmingcombinatorial optimization

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Consumer behavior, demand theory (91B42)

Related Items (9)

Advanced conjoint analysis using feature selection via support vector machines ⋮ Share-of-surplus product line optimisation with price levels ⋮ Using hierarchical Bayes draws for improving shares of choice predictions in conjoint simulations: a study based on conjoint choice data ⋮ Integrating supplier selection in optimal product family design ⋮ Bayesian coverage optimization models ⋮ On the product line selection problem under attraction choice models of consumer behavior ⋮ A Stackelberg-Nash model for new product design ⋮ Fuzzy self-tuning differential evolution for optimal product line design ⋮ Political engineering: optimizing a U.S. Presidential candidate's platform

This page was built for publication: Conjoint Optimization: An Exact Branch-and-Bound Algorithm for the Share-of-Choice Problem