Evolutionary Algorithms , Randomized Local Search , and the Maximum Matching Problem ∗

@inproceedings{Giel2003EvolutionaryA,
  title={Evolutionary Algorithms , Randomized Local Search , and the Maximum Matching Problem ∗},
  author={Oliver Giel and Ingo Wegener},
  year={2003}
}
The design and analysis of problem-specific algorithms for combinatorial optimization problems is a well-studied subject. It is accepted that randomization is a powerful concept for theoretically and practically efficient problem-specific algorithms. Randomized search heuristics like randomized local search, tabu search, simulated annealing, and variants of evolutionary algorithms can be combined with problem-specific modules. The subject of this paper are general and not problem-specific… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.