Skip to Main Content

Advertisement

MIT Press Direct, home
header search
Search
Advanced Search
Skip Nav Destination

Issues

Volume 20, Issue 4
Winter 2012
Issue Cover
All Issues
ISSN 1063-6560
EISSN 1530-9304

Special Issue on Benchmarking of Continuous Black Box Optimization Algorithms

Benchmarking of Continuous Black Box Optimization Algorithms
Anne Auger, Nikolaus Hansen, Marc Schoenauer
Evolutionary Computation (2012) 20 (4): 481.
View articletitled, Benchmarking of Continuous Black Box Optimization Algorithms
Open the PDF for in another window
Experimental Comparison of Six Population-Based Algorithms for Continuous Black Box Optimization
Petr Pošík, Jiří Kubalík
Evolutionary Computation (2012) 20 (4): 483–508.
View articletitled, Experimental Comparison of Six Population-Based Algorithms for Continuous Black Box Optimization
Open the PDF for in another window
A Comparison of Global Search Algorithms for Continuous Black Box Optimization
Petr Pošík, Waltraud Huyer, László Pál
Evolutionary Computation (2012) 20 (4): 509–541.
View articletitled, A Comparison of Global Search Algorithms for Continuous Black Box Optimization
Open the PDF for in another window
Energy Landscapes of Atomic Clusters as Black Box Optimization Benchmarks
C. L. Müller, I. F. Sbalzarini
Evolutionary Computation (2012) 20 (4): 543–573.
View articletitled, Energy Landscapes of Atomic Clusters as Black Box Optimization Benchmarks
Open the PDF for in another window
Restarted Local Search Algorithms for Continuous Black Box Optimization
Petr Pošík, Waltraud Huyer
Evolutionary Computation (2012) 20 (4): 575–607.
View articletitled, Restarted Local Search Algorithms for Continuous Black Box Optimization
Open the PDF for in another window
Black Box Optimization Benchmarking of the GLOBAL Method
László Pál, Tibor Csendes, Mihály Csaba Markót, Arnold Neumaier
Evolutionary Computation (2012) 20 (4): 609–639.
View articletitled, Black Box Optimization Benchmarking of the GLOBAL Method
Open the PDF for in another window

Regular Paper

A Multilevel Memetic Algorithm for Large SAT-Encoded Problems
Noureddine Bouhmala
Evolutionary Computation (2012) 20 (4): 641–664.
View articletitled, A Multilevel Memetic Algorithm for Large SAT-Encoded Problems
Open the PDF for in another window

Product(s) added to cart

Go to Cart Continue Browsing
Close Modal

Advertisement

Advertisement

  • Online ISSN 1530-9304
  • Print ISSN 1063-6560
A product of The MIT Press
Newsletter sign up

MIT Press Direct

Information

MIT Press

Contact Us

© 2024 The MIT Press
Close Modal
This Feature Is Available To Subscribers Only

or Create an Account

Close Modal
Close Modal
This site uses cookies. By continuing to use our website, you are agreeing to our privacy policy. No content on this site may be used to train artificial intelligence systems without permission in writing from the MIT Press.
Accept