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 |
| Author: | 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. |
| Peer review: | yes |
| URI: | http://hdl.handle.net/10773/4253 |
| ISSN: | 1072-3374 |
| Publisher Version: | http://www.springerlink.com/content/0t5m504066k12u6x/ |
| Appears in Collections: | DMat - Artigos |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| AgraEtAl(SpringerFile).pdf | Electronic Version | 133.12 kB | Adobe PDF |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.