Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Memetic Algorithms: The Polynomial Local Search Complexity Theory Perspective


    Contributors:
    Krasnogor, N. (author) / Smith, J. (author)


    Publication date :

    2008-01-01


    Size :

    22 pages



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English


    Classification :

    DDC:    003.3



    Memetic algorithm with adaptive local search for Capacitated Arc Routing Problem

    Yao, Tingting / Yao, Xin / Han, Shuangshuang et al. | IEEE | 2017


    Efficient Batch Job Scheduling in Grids Using Cellular Memetic Algorithms

    Xhafa, F. / Alba, E. / Dorronsoro, B. et al. | British Library Online Contents | 2008



    Demonstrating Polynomial Run-time Growth for Local Search Matching

    Beveridge, J. R. / Riseman, E. R. / Graves, C. R. et al. | British Library Conference Proceedings | 1995


    Hybrid Flow-Shop: a Memetic Algorithm Using Constraint-Based Scheduling for Efficient Search

    Jouglet, A. / Oğuz, C. / Sevaux, M. | British Library Online Contents | 2009