Time complexity of evolutionary algorithms for combinatorial optimization: a decade of results

Oliveto, P.S., He, J. ORCID: 0000-0002-5616-4691 and Yao, X., 2007. Time complexity of evolutionary algorithms for combinatorial optimization: a decade of results. International Journal of Automation and Computing, 4 (3), pp. 281-293. ISSN 1476-8186

Full text not available from this repository.

Item Type:	Journal article
Publication Title:	International Journal of Automation and Computing
Creators:	Oliveto, P.S., He, J. and Yao, X.
Publisher:	Springer
Date:	July 2007
Volume:	4
Number:	3
ISSN:	1476-8186
Identifiers:	Number Type 10.1007/s11633-007-0281-3 DOI 1262248 Other
Divisions:	Schools > School of Science and Technology
Record created by:	Jonathan Gallacher
Date Added:	17 Jan 2020 13:41
Last Modified:	17 Jan 2020 13:41
URI:	https://irep.ntu.ac.uk/id/eprint/38997

Actions (login required)

Edit View

Views

Downloads