Repositório Institucional da Universidade de Aveiro > Departamento de Matemática > MAT - Artigos >
 Solving huge size instances of the optimal diversity management problem
Please use this identifier to cite or link to this item http://hdl.handle.net/10773/4253

title: Solving huge size instances of the optimal diversity management problem
authors: Agra, A.
Cardoso, D.M.
Cerdeira, J.O.
Miranda, M.
Rocha, E.
keywords: Combinatorial optimization
Operational research
issue date: 2009
publisher: Springer Verlag
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.
URI: http://hdl.handle.net/10773/4253
ISSN: 1072-3374
publisher version/DOI: http://www.springerlink.com/content/0t5m504066k12u6x/
source: Journal of Mathematical Sciences
appears in collectionsMAT - Artigos

files in this item

file description sizeformat
AgraEtAl(SpringerFile).pdfElectronic Version133.12 kBAdobe PDFview/open
Restrict Access. You can Request a copy!

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! RCAAP OpenAIRE DeGóis
ria-repositorio@ua.pt - Copyright ©   Universidade de Aveiro - RIA Statistics - Powered by MIT's DSpace software, Version 1.6.2