IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/66122.html
   My bibliography  Save this paper

Sur le théorème de contacte de Collette & Siarry
[about the contact theorem Collette & Siarry]

Author

Listed:
  • Okitonyumbe Y.F., Joseph
  • Ulungu, Berthold E.-L.

Abstract

Résumé : Les méthodes de résolution des problèmes d’optimisation combinatoire multi-objectif sont confrontées à la difficulté liée à la caractérisation des solutions efficaces. Le présent article essai d’apporter une contribution à cette préoccupation en revisitant le théorème de contact énoncé sans démonstration par Yann Collette et Patrick Siarry depuis 2002. Abstract : Methods for solving multi-objective combinatorial optimization problems are classified in two categories indeed exact and metaheuristics methods. The latter class is more competitive than the first, for solving larger problems, But the implementation of these exacts and metaheuristics methods presents two inherent difficulties namely the characterization of efficient solutions and acceptance rules for neighborhoods system. This article tackles the first problem.

Suggested Citation

  • Okitonyumbe Y.F., Joseph & Ulungu, Berthold E.-L., 2013. "Sur le théorème de contacte de Collette & Siarry [about the contact theorem Collette & Siarry]," MPRA Paper 66122, University Library of Munich, Germany.
    • Handle: RePEc:pra:mprapa:66122
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/66122/1/MPRA_paper_66122.pdf
    File Function: original version
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Mots clés : Ensemble des solutions efficaces; Espace de décisions; Espace des objectifs; Optimisation combinatoire multi-objectif. KEY WORDS : Decision space; Set of efficient solution; Objective space; Multi-objective combinatorial optimization.;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:66122. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.