Optimizing Product Line Designs: Efficient Methods and Comparisons

References

• Aarts E., Korst J., van Laarhoven P., Aarts E., Lenstra J. K. Simulated annealing. Local Search in Combinatorial Optimization (1997) (John Wiley & Sons, Chichester, UK) 91–120Google Scholar
• Alexouda G., Paparrizos K. A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study. Eur. J. Oper. Res. (2001) 134(1):165–178Crossref, Google Scholar
• Balakrishnan P. V., Jacob V. S. Genetic algorithms for product design. Management Sci. (1996) 42(8):1105–1117Link, Google Scholar
• Balakrishnan P. V., Gupta R., Jacob V. Development of hybrid genetic algorithms for product line designs. IEEE Trans. Systems, Man, Cybernetics (2004) 34(1):468–483Crossref, Google Scholar
• Belloni A., Lucena A., Resende M. G. C., de Sousa J. P. Lagrangian heuristics for the linear ordering problem. Metaheuristics: Computer Decision-Making (2004) (Kluwer Academic Publishers, Norwell, MA) 37–64Google Scholar
• Belloni A., Sagastizábal C. Dynamic bundle methods. Math. Programming (2008) . ForthcomingGoogle Scholar
• Bertsekas D. P.Nonlinear Programming (1999) (Athena Scientific, Belmont, MA) Google Scholar
• Bertsimas D., Tsitsiklis J.Introduction to Linear Optimization (1997) (Athena Scientific, Belmont, MA) Google Scholar
• Camm J. D., Cochran J. J., Curry D. J., Kannan S. Conjoint optimization: An exact branch-and-bound algorithm for the share-of-choice problem. Management Sci. (2006) 52(3):435–447Link, Google Scholar
• Dobson G., Kalish S. Positioning and pricing a product line. Marketing Sci. (1988) 7(2):107–125Link, Google Scholar
• Dobson G., Kalish S. Heuristics for pricing and positioning a product line using conjoint and cost data. Management Sci. (1993) 39(2):160–175Link, Google Scholar
• Green P. E., Krieger A. M. Models and heuristics for product line selection. Marketing Sci. (1985) 4(1):1–19Link, Google Scholar
• Green P. E., Krieger A. M., Eliashberg J., Lilien G. L. Conjoint analysis with product-positioning applications. Handbooks in Operations Research & Management Science (1993) 5(Elsevier Science B.V., Amsterdam) 467–515Google Scholar
• Green P. E., Krieger A. M., Zelnio R. N. A componential segmentation model with optimal design features. Decision Sci. (1989) 20(2):221–238Crossref, Google Scholar
• Gutin G., Punnen A.The Traveling Salesman Problem and Its Variation (2002) (Kluwer Academic Publishes, Dordrecht, The Netherlands) Google Scholar
• Kellerer H., Pferschy U., Pisinger D.Knapsack Problems (2004) (Springer, Berlin) Crossref, Google Scholar
• Kivetz R., Netzer O., Srinivasan V. Alternative models for capturing the compromise effect. J. Marketing Res. (2004) 41(3):237–257Crossref, Google Scholar
• Kohli R., Krishnamurti R. A heuristic approach to product design. Management Sci. (1987) 33(12):1523–1533Link, Google Scholar
• Kohli R., Krishnamurti R. Optimal product design using conjoint analysis: Computational complexity and algorithms. Eur. J. Oper. Res. (1989) 40:186–195Crossref, Google Scholar
• Kohli R., Sukumar R. Heuristics for product-line design using conjoint analysis. Management Sci. (1990) 36(12):1464–1478Link, Google Scholar
• Lucena A. Steiner problem in graphs: Lagrangian relaxation and cutting-planes. COAL Bull. (1992) 21:2–8Google Scholar
• Lucena A. Tight bounds for the Steiner problem in graphs. Proc. NETFLOW93 (1993) 147–154Google Scholar
• McBride R. D., Zufryden F. S. An integer programming approach to the optimal product line selection problem. Marketing Sci. (1988) 7(2):126–140Link, Google Scholar
• Nair S. K., Thakur L. S., Wen K. Near optimal solutions for product line design and selection: Beam search heuristics. Management Sci. (1995) 41(5):767–785Link, Google Scholar
• Shi L., Olafsson S. Nested partitions method for global optimization. Oper. Res. (2000) 48(3):390–407Link, Google Scholar
• Shi L., Olafsson S., Chen Q. An optimization framework for product design. Management Sci. (2001) 47(12):1681–1692Link, Google Scholar
• Steiner W., Hruschka H. Genetic algorithms for product design: How well do they really work? Internat. J. Market Res. (2003) 45(2):229–240Crossref, Google Scholar
• Toubia O., Simester D. I., Hauser J. R., Dahan E. Fast polyhedral adaptive conjoint estimation. Marketing Sci. (2003) 22(3):273–303Link, Google Scholar