framework of evolutionary algorithms (EAs). One of the main goals behind this unification is
to develop an analytical method that verifies if a problem's landscape belongs to certain
abstract convex landscape classes, where certain recombination-based EAs (without
mutation) have polynomial runtime performance. This paper advances such unification by
showing that:(a) crossovers can be formally classified according to geometric or algebraic …