Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/4253
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAgra, A.pt
dc.contributor.authorCardoso, D.M.pt
dc.contributor.authorCerdeira, J.O.pt
dc.contributor.authorMiranda, M.pt
dc.contributor.authorRocha, E.pt
dc.date.accessioned2011-11-04T11:09:45Z-
dc.date.issued2009-
dc.identifier.issn1072-3374pt
dc.identifier.urihttp://hdl.handle.net/10773/4253-
dc.description.abstractWe 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.pt
dc.description.sponsorshipCEOCpt
dc.description.sponsorshipFCTpt
dc.description.sponsorshipFEDER/POCI 2010pt
dc.language.isoengpt
dc.publisherSpringer Verlagpt
dc.relation.urihttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350303576&partnerID=40&md5=1432dff6afd8a89f383af78d573c8666-
dc.rightsrestrictedAccesspor
dc.subjectCombinatorial optimizationpt
dc.subjectOperational researchpt
dc.titleSolving huge size instances of the optimal diversity management problempt
dc.typearticlept
dc.peerreviewedyespt
ua.distributioninternationalpt
degois.publication.firstPage956pt
degois.publication.issue6pt
degois.publication.issue6-
degois.publication.lastPage960pt
degois.publication.titleJournal of Mathematical Sciencespt
degois.publication.volume161pt
dc.date.embargo10000-01-01-
dc.relation.publisherversionhttp://www.springerlink.com/content/0t5m504066k12u6x/*
Appears in Collections:DMat - Artigos

Files in This Item:
File Description SizeFormat 
AgraEtAl(SpringerFile).pdfElectronic Version133.12 kBAdobe PDFrestrictedAccess


FacebookTwitterLinkedIn
Formato BibTex MendeleyEndnote Degois 

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