June 01, 2012 article A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms IEEE Transactions on Evolutionary Computation DOI: 10.1109/tevc.2012.2202241 OpenAlex Authors 0 Author list not loaded yet. Cited by 2 stored of 190 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Do additional target points speed up evolutionary algorithms? 2023 Theoretical Computer Science article Computer Science Metaheuristic Optimization Algorithms Research 4 citations Benchmarking a $$(\mu +\lambda )$$ Genetic Algorithm with Configurable Crossover Probability 2020 Lecture notes in computer science conference-paper Computer Science Metaheuristic Optimization Algorithms Research Open access 15 citations 2 results References 0