On complexity of optimal recombination in genetic algorithms for one-dinansional bin paking problems

Alexandre Dolgui 1 Anton Eremeev
1 Laboratoire en Sciences et Technologies de l'Information
LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes, DEMO-ENSMSE - Département Décision en Entreprise : Modélisation, Optimisation
Document type :
Conference papers
Complete list of metadatas

https://hal-emse.ccsd.cnrs.fr/emse-00881669
Contributor : Florent Breuil <>
Submitted on : Friday, November 8, 2013 - 4:41:50 PM
Last modification on : Thursday, October 17, 2019 - 12:36:36 PM

Identifiers

  • HAL Id : emse-00881669, version 1

Citation

Alexandre Dolgui, Anton Eremeev. On complexity of optimal recombination in genetic algorithms for one-dinansional bin paking problems. III-th International conference on Dynamics of Systems, Mechanismes and Machines, Nov 2012, Omsk, Russia. p. 25-27. ⟨emse-00881669⟩

Share

Metrics

Record views

108