Skip to Main content Skip to Navigation
Conference papers

Computing finite size representations of the set of approximate solutions of an MOP with stochastic search algorithms

O. Schutze 1 Carlos A. Coello Coello 1 Emilia Tantar 2 El-Ghazali Talbi 3
2 ALEA - Advanced Learning Evolutionary Algorithms
Inria Bordeaux - Sud-Ouest, UB - Université de Bordeaux, CNRS - Centre National de la Recherche Scientifique : UMR5251
3 DOLPHIN - Parallel Cooperative Multi-criteria Optimization
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-00837522
Contributor : Talbi El-Ghazali <>
Submitted on : Saturday, June 22, 2013 - 5:44:26 PM
Last modification on : Thursday, May 28, 2020 - 9:22:09 AM

Identifiers

  • HAL Id : hal-00837522, version 1

Citation

O. Schutze, Carlos A. Coello Coello, Emilia Tantar, El-Ghazali Talbi. Computing finite size representations of the set of approximate solutions of an MOP with stochastic search algorithms. GECCO'2008 Genetic and Evolutionary Computations Conference, Jul 2008, Atlanta, United States. pp.713-720. ⟨hal-00837522⟩

Share

Metrics

Record views

259