A probabilistic analysis of the switching algorithm for the Euclidean TSP

Authors:
Walter Kern
Affiliations:
Univ. zu Koln, Germany
Venue:
Mathematical Programming: Series A and B
Year:
1989

Citing 0
Cited 3

On the complexity of local search

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
New results on the old k-opt algorithm for the TSP

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
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

Quantified Score

Hi-index	0.00

Visualization

Abstract