Skip to main content
SpringerLink
Log in

Solving huge size instances of the optimal diversity management problem

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Agra and C. Requejo, “On the linking set problem,” Cadernos de Matemática, Universidade de Aveiro, CM07 (2007).

  2. P. Avella, M. Boccia, C. D. Martino, G. Oliviero, and A. Sforza, “A decomposition approach for a very large scale optimal diversity management problem,” 4OR 3, No. 1, 23–37 (2005).

    Article  MATH  MathSciNet  Google Scholar 

  3. O. Briant, Étude Théorique et Numérique du Problème de la Gestion de la Diversité, PhD thesis, Institut National Polytechnique de Grenoble (2000).

  4. O.Briant and D. Naddef, “The optimal diversity management problem,” Oper. Res., 52, No. 4, 515–526 (2004).

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Garey and D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco (1979).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemática, Universidade de Aveiro, Aveiro, Portugal

    A. Agra, D. M. Cardoso & E. Rocha

  2. Departamento de Matemática and Centro de Estudos Florestais, Instituto Superior de Agronomia, Lisboa, Portugal

    J. O. Cerdeira

  3. Yazaki Saltano, Ovar, Portugal

    M. Miranda

Authors
  1. A. Agra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. M. Cardoso
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. O. Cerdeira
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Miranda
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. E. Rocha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. Agra.

Additional information

Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 63, Optimal Control, 2009.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Agra, A., Cardoso, D.M., Cerdeira, J.O. et al. Solving huge size instances of the optimal diversity management problem. J Math Sci 161, 956–960 (2009). https://doi.org/10.1007/s10958-009-9614-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-009-9614-9

Keywords

Search

Navigation