Author： Ding Xiaosong Al-Khayyal Faiz
Publisher： Springer Publishing Company
ISSN： 0925-5001
Source： Journal of Global Optimization, Vol.38, Iss.3, 2007-07, pp. : 421-436
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
A Long-Step, Cutting Plane Algorithm for Linear and Convex Programming
Annals of Operations Research, Vol. 99, Iss. 1-4, 2000-12 ,pp. :
Access to resources
Recommend
On the convergence rates of genetic algorithms
Theoretical Computer Science, Vol. 229, Iss. 1, 1999-11 ,pp. :
Simple On-Line Algorithms for the Maximum Disjoint Paths Problem
By Kolman Petr Scheideler Christian
Algorithmica, Vol. 39, Iss. 3, 2004-04 ,pp. :
Genetic algorithms: bridging the convergence gap
By Lozano J.A. Larranaga P. Grana M. Albizuri F.X.
Theoretical Computer Science, Vol. 229, Iss. 1, 1999-11 ,pp. :