On Complexity of Optimal Recombination for Binary Representations of Solutions

@article{Eremeev2008OnCO,
  title={On Complexity of Optimal Recombination for Binary Representations of Solutions},
  author={Anton V. Eremeev},
  journal={Evolutionary Computation},
  year={2008},
  volume={16},
  pages={127-147}
}
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 problem… CONTINUE READING
10 Citations
28 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

An optimized crossover for maximum independent

  • C. Aggarwal, J. Orlin, R. Tai
  • 1997
Highly Influential
11 Excerpts

An optimized crossover for maximum independent set

  • C. Aggarwal, J. Orlin, R. Tai
  • Operations Research
  • 1997
Highly Influential
7 Excerpts

Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems

  • D. S. Hochbaum
  • 1997
Highly Influential
3 Excerpts

The simple plant location problem: Survey and synthesis

  • J. Krarup, P. Pruzan
  • European Journal of Operational Research,
  • 1983
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…