On complexity of optimal recombination in genetic algorithms for one-dinansional bin paking problems - Mines Saint-Étienne Access content directly
Conference Papers Year : 2013

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

No file

Dates and versions

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

Identifiers

  • HAL Id : emse-00881669 , version 1

Cite

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⟩
60 View
0 Download

Share

Gmail Facebook X LinkedIn More