Computing Minimum Cuts by Randomized Search Heuristics

This publication has 21 references indexed in Scilit:

• Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization
  2008
• Approximating covering problems by randomized search heuristics using multi-objective models
  2007
• A low-level hybridization between memetic algorithm and VNS for the max-cut problem
  2005
• Expected runtimes of a simple multi-objective evolutionary algorithm
  2004
• Evolutionary Algorithms and the Maximum Matching Problem
  2003
• Combining Convergence and Diversity in Evolutionary Multiobjective Optimization
  Evolutionary Computation, 2002
• On the analysis of the (1+1) evolutionary algorithm
  Theoretical Computer Science, 2002
• Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness
  IEEE Transactions on Evolutionary Computation, 2001
• The Complexity of Multiterminal Cuts
  SIAM Journal on Computing, 1994
• Introduction to Algorithms
  Journal of the Operational Research Society, 1991