A Complexity Analysis of Local Search Algorithms in Global Optimization

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.17, Iss.1, 2002-01, pp. : 113-127

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

Three new stochastic local search algorithms for continuous optimization problems

By Chetty Sivashan Adewumi Aderemi

Computational Optimization and Applications, Vol. 56, Iss. 3, 2013-12 ,pp. : 675-721

Springer Publishing Company

Access to resources Recommend Favorite

Combining a Local Search and Grover’s Algorithm in Black-Box Global Optimization

By Bulger D.

Journal of Optimization Theory and Applications, Vol. 133, Iss. 3, 2007-06 ,pp. : 289-301

Springer Publishing Company

Access to resources Recommend Favorite

Coordinate search algorithms in multilevel optimization

By Frandi Emanuele Papini Alessandra

Optimization Methods and Software, Vol. 29, Iss. 5, 2014-09 ,pp. : 1020-1041

Taylor & Francis Ltd

Access to resources Recommend Favorite

The complexity of Boolean constraint satisfaction local search problems

By Chapdelaine Philippe

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1, 2005-01 ,pp. : 51-63

Springer Publishing Company

Access to resources Recommend Favorite

The Complexity of Boolean Constraint Satisfaction Local Search Problems

By Chapdelaine Philippe

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1-4, 2005-01 ,pp. : 51-63

Springer Publishing Company

Access to resources Recommend Favorite