Optimization with randomized search heuristics-the (A)NFL theorem, realistic scenarios, and difficult functions

Author： Droste S.   Jansen T.   Wegener I.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.287, Iss.1, 2002-09, pp. : 131-144

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Special issue on hyper-heuristics in search and optimization

By Ochoa Gabriela  

Journal of Heuristics, Vol. 16, Iss. 6, 2010-12 ,pp. : 745-748

Springer Publishing Company

Access to resources Recommend Favorite

Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)

By Boros Endre   Hammer Peter   Tavares Gabriel  

Journal of Heuristics, Vol. 13, Iss. 2, 2007-04 ,pp. : 99-132

Springer Publishing Company

Access to resources Recommend Favorite

Beyond Convex? Global Optimization is Feasible Only for Convex Objective Functions: A Theorem

By Kreinovich Vladik   Kearfott R.  

Journal of Global Optimization, Vol. 33, Iss. 4, 2005-12 ,pp. : 617-624

Springer Publishing Company

Access to resources Recommend Favorite

Experimental Testing of Advanced Scatter Search Designs for Global Optimization of Multimodal Functions

By Laguna Manuel   Martí Rafael  

Journal of Global Optimization, Vol. 33, Iss. 2, 2005-10 ,pp. : 235-255

Springer Publishing Company

Access to resources Recommend Favorite

Quantifying Heuristics in the Ordinal Optimization Framework

By Shen Zhen   Zhao Qian-Chuan   Jia Qing-Shan  

Discrete Event Dynamic Systems, Vol. 20, Iss. 4, 2010-12 ,pp. : 441-471

Springer Publishing Company

Access to resources Recommend Favorite