A heuristic genetic algorithm for product portfolio planning
type: Item
instance of: scholarly article
title: A heuristic genetic algorithm for product portfolio planning
zbMATH Open document ID: 1159.90371
author: Jianxin (Roger) Jiao
author: Yiyang Zhang
author: Yi Wang
published in: Computers \& Operations Research
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5082746
zbMATH Keywords: mass customization
zbMATH Keywords: genetic algorithm
zbMATH Keywords: product portfolio
zbMATH Keywords: variety management
zbMATH Keywords: customer decision making
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.cor.2005.05.033
OpenAlex ID: W2084341364
cites work: Near Optimal Solutions for Product Line Design and Selection: Beam Search Heuristics
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Q4256465
cites work: Q4198056
cites work: Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
cites work: A user's guide to tabu search
cites work: Q4495496
cites work: Q4339078
cites work: An evolutionary algorithm approach to the share of choices problem in the product line design
cites work: A genetic algorithm for the generalised assignment problem
cites work: Genetic Algorithms for Product Design
DOI: 10.1016/J.COR.2005.05.033
description: scientific article; zbMATH DE number 5082746