Memetic algorithms: The polynomial local search complexity theory perspective (Q2481603): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4365126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of local search for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the p-median / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drift analysis and average time complexity of evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution algorithms in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The analysis of evolutionary algorithms on sorting and shortest paths problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365127 / rank
 
Normal rank

Latest revision as of 20:14, 27 June 2024

scientific article
Language Label Description Also known as
English
Memetic algorithms: The polynomial local search complexity theory perspective
scientific article

    Statements

    Memetic algorithms: The polynomial local search complexity theory perspective (English)
    0 references
    0 references
    0 references
    11 April 2008
    0 references
    Memetic algorithms
    0 references
    Genetic local search hybrids
    0 references
    Evolutionary hybrid algorithms
    0 references
    Travelling salesman problem
    0 references
    Graph partitioning
    0 references
    Polynomial local search
    0 references
    Multimeme algorithms
    0 references
    Meta-Lamarckian algorithms
    0 references
    Hyper-heuristics
    0 references

    Identifiers