Evolving Combinatorial Problem Instances That Are Difficult to Solve

@article{Hemert2006EvolvingCP,
  title={Evolving Combinatorial Problem Instances That Are Difficult to Solve},
  author={Jano I. van Hemert},
  journal={Evolutionary Computation},
  year={2006},
  volume={14},
  pages={433-462}
}
This paper demonstrates how evolutionary computation can be used to acquire difficult to solve combinatorial problem instances. As a result of this technique, the corresponding algorithms used to solve these instances are stress-tested. The technique is applied in three important domains of combinatorial optimisation, binary constraint satisfaction, Boolean satisfiability, and the travelling salesman problem. The problem instances acquired through this technique are more difficult than the ones… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

References

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

The Constrainedness of Search

View 4 Excerpts
Highly Influenced

Computational complexity

View 4 Excerpts
Highly Influenced

Can’t Get No Satisfaction

View 1 Excerpt
Highly Influenced

Generating Hard Satisfiability Problems

View 1 Excerpt
Highly Influenced

Similar Papers

Loading similar papers…