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

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

Alexandre Dolgui
Laboratoire en Sciences et Technologies de l'Information
CV
Anton Eremeev
  • Function : Author

Domains

Modeling and Simulation

Florent Breuil  : Connect in order to contact the contributor

https://hal-emse.ccsd.cnrs.fr/emse-00881669

Submitted on : Friday, November 8, 2013-4:41:50 PM

Last modification on : Tuesday, September 17, 2024-3:45:33 PM

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

EMSE PRES_CLERMONT CNRS FAYOL-ENSMSE LIMOS DEMO-ENSMSE TDS-MACS CLERMONT-AUVERGNE-INP INSTITUT-MINES-TELECOM
75 View
0 Download

Share

More