A pruning heuristic for use with multisource product design

DOI10.1016/S0377-2217(99)00350-1zbMath0982.90021MaRDI QIDQ1592736

Peter Tarasewich, Patrick R. Mcmullen

Publication date: 11 April 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicstabu searchgenetic algorithmsproduct designconjoint analysis

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (3)

Willingness-to-pay estimation with choice-based conjoint analysis: addressing extreme response behavior with individually adapted designs ⋮ Issues in the use of ratings-based versus choice-based conjoint analysis in operations management research ⋮ A revised imperialist competition algorithm for cellular manufacturing optimization based on product line design

Cites Work

• Unnamed Item
• Optimal product design using conjoint analysis: Computational complexity and algorithms
• Genetic Algorithms for Product Design
• Near Optimal Solutions for Product Line Design and Selection: Beam Search Heuristics

This page was built for publication: A pruning heuristic for use with multisource product design