Randomized algorithms
ACM Computing Surveys (CSUR)
Evolutionary Algorithms and the Maximum Matching Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A dynamic programming approach to sequencing problems
ACM '61 Proceedings of the 1961 16th ACM national meeting
Maximum cardinality matchings on trees by randomized local search
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Theoretical Computer Science
Approximating covering problems by randomized search heuristics using multi-objective models
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Evolutionary algorithms and matroid optimization problems
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Crossover can provably be useful in evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Computing minimum cuts by randomized search heuristics
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Worst-case and average-case approximations by simple randomized search heuristics
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Particle swarm for the traveling salesman problem
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Fast EAX algorithm considering population diversity for traveling salesman problems
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Evolutionary algorithms and dynamic programming
Theoretical Computer Science
| Hi-index | 0.00 |
This articles introduces a (μ + 1)-EA, which is proven to be an exact TSP problem solver for a population of exponential size. We will show non-trivial upper bounds on the runtime until an optimum solution has been found. To the best of our knowledge this is the first time it has been shown that an $\mathcal{NP}$-hard problem is solved exactly instead of approximated only by a black box algorithm.