On complexity of optimal recombination in genetic algorithms for one-dinansional bin paking problems - Mines Saint-Étienne
Communication Dans Un Congrès Année : 2013

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

Fichier non déposé

Dates et versions

emse-00881669 , version 1 (08-11-2013)

Identifiants

  • HAL Id : emse-00881669 , version 1

Citer

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⟩
76 Consultations
0 Téléchargements

Partager

More