A robust approach to the share-of-choice product design problem
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Suresh K. Nair & Lakshman S. Thakur & Kuang-Wei Wen, 1995. "Near Optimal Solutions for Product Line Design and Selection: Beam Search Heuristics," Management Science, INFORMS, vol. 41(5), pages 767-785, May.
- 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.
- 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.
- Leyuan Shi & Sigurdur Ólafsson & Qun Chen, 2001. "An Optimization Framework for Product Design," Management Science, INFORMS, vol. 47(12), pages 1681-1692, December.
- Peter E. Rossi & Greg M. Allenby, 2003. "Bayesian Statistics and Marketing," Marketing Science, INFORMS, vol. 22(3), pages 304-328, July.
- P. V. (Sundar) Balakrishnan & Varghese S. Jacob, 1996. "Genetic Algorithms for Product Design," Management Science, INFORMS, vol. 42(8), pages 1105-1117, August.
- Rajeev Kohli & R. Sukumar, 1990. "Heuristics for Product-Line Design Using Conjoint Analysis," Management Science, INFORMS, vol. 36(12), pages 1464-1478, December.
- Sandeep R. Chandukala & Yancy D. Edwards & Greg M. Allenby, 2011. "Identifying Unmet Demand," Marketing Science, INFORMS, vol. 30(1), pages 61-73, 01-02.
- Rajeev Kohli & Ramesh Krishnamurti, 1987. "A Heuristic Approach to Product Design," Management Science, INFORMS, vol. 33(12), pages 1523-1533, December.
- Peter J. Lenk & Wayne S. DeSarbo & Paul E. Green & Martin R. Young, 1996. "Hierarchical Bayes Conjoint Analysis: Recovery of Partworth Heterogeneity from Reduced Experimental Designs," Marketing Science, INFORMS, vol. 15(2), pages 173-191.
- Jeffrey D. Camm & James J. Cochran & David J. Curry & Sriram Kannan, 2006. "Conjoint Optimization: An Exact Branch-and-Bound Algorithm for the Share-of-Choice Problem," Management Science, INFORMS, vol. 52(3), pages 435-447, March.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Yang, Muer & Wang, Xinfang (Jocelyn) & Xu, Nuo, 2015. "A robust voting machine allocation model to reduce extreme waiting," Omega, Elsevier, vol. 57(PB), pages 230-237.
- Chica, Manuel & Bautista, Joaquín & Cordón, Óscar & Damas, Sergio, 2016. "A multiobjective model and evolutionary algorithms for robust time and space assembly line balancing under uncertain demand," Omega, Elsevier, vol. 58(C), pages 55-68.
- Mavrotas, George & Figueira, José Rui & Siskos, Eleftherios, 2015. "Robustness analysis methodology for multi-objective combinatorial optimization problems and application to project selection," Omega, Elsevier, vol. 52(C), pages 142-155.
- Gorissen, Bram L. & Yanıkoğlu, İhsan & den Hertog, Dick, 2015. "A practical guide to robust optimization," Omega, Elsevier, vol. 53(C), pages 124-137.
More about this item
KeywordsInteger programming; Robust optimization; Conjoint analysis; Product line design; Share-of-choice;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:40:y:2012:i:6:p:818-826. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.