Please use this identifier to cite or link to this item:
|Title:||Solving huge size instances of the optimal diversity management problem|
|Abstract:||We report a real application project in a car industry optimization problem known as the optimal diversity management problem. We provide an alternative proof of NP-hardness, and we give and discuss the results obtained from a greedy algorithm applied to huge size instances. © 2009 Springer Science+Business Media, Inc.|
|Appears in Collections:||MAT - Artigos|
Files in This Item:
|AgraEtAl(SpringerFile).pdf||Electronic Version||133.12 kB||Adobe PDF||View/Open Request a copy|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.