Average-case approximation ratio of the 2-opt algorithm for the TSP

@article{Engels2009AveragecaseAR,
  title={Average-case approximation ratio of the 2-opt algorithm for the TSP},
  author={Christian Engels and Bodo Manthey},
  journal={Oper. Res. Lett.},
  year={2009},
  volume={37},
  pages={83-84}
}
The traveling salesman problem (TSP) is one of the most important problems in combinatorial optimization: Given a complete graph with edge weights, the goal is to find a Hamiltonian cycle (also called a tour) of minimum weight. 2-opt is probably the most widely used local search heuristic for the TSP. It incrementally improves an initial tour by exchanging two edges of the tour with two other edges, until a local optimum is reached. More formally: Let w be the edge weights. If {a, b} and {c, d… CONTINUE READING