M. Buzdalov

activity

20152023

(1 + (λ, λ))

Genetic Algorithm on Random Satisfiable 3-CNF Formulas

65 citations · 151 across the 17 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

cs.NE2017★ 65 cited

Runtime Analysis of the $(1 + (λ, λ))$ Genetic Algorithm on Random Satisfiable 3-CNF Formulas

Maxim Buzdalov, Benjamin Doerr

The $(1 + (λ, λ))$ genetic algorithm, first proposed at GECCO 2013, showed a surprisingly good performance on so me optimization problems. The theoretical analysis so far was restrict…

cs.DS2017★ 8 cited

Hybridizing Non-dominated Sorting Algorithms: Divide-and-Conquer Meets Best Order Sort

Margarita Markina, Maxim Buzdalov

Many production-grade algorithms benefit from combining an asymptotically efficient algorithm for solving big problem instances, by splitting them into smaller ones, and an asympto…

Runtime Analysis of the (1+(λ,λ)) Genetic Algorithm on Random Satisfiable 3-CNF Formulas

Hybridizing Non-dominated Sorting Algorithms: Divide-and-Conquer Meets Best Order Sort

Runtime Analysis of the $(1 + (λ, λ))$ Genetic Algorithm on Random Satisfiable 3-CNF Formulas