General constraints are relaxed by a nonlinear penalty function for which the corresponding dual problem has weak and strong duality. The relaxed problem is attacked by a genetic algorithm with ...

Zooming In On Genetic Shuffling Date: July 13, 2008 Source: European Molecular Biology Laboratory Summary: Researchers have presented the most precise map of genetic recombination yet.