A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On Complexity of Optimal Recombination for Binary Representations of Solutions

2008
*
Evolutionary Computation
*

We consider the optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The optimal recombination is studied in the case, where a vector of binary variables is used as a solution encoding. By means of efficient reductions of the optimal recombination problems (ORPs) we show the polynomial solvability of the ORPs for the maximum weight set packing problem, the minimum weight set partition

doi:10.1162/evco.2008.16.1.127
pmid:18386998
fatcat:4yfb5yf26bffvbb32zxtjzuff4