research
∙
08/31/2021
The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem
The k-Opt heuristic is a simple improvement heuristic for the Traveling ...
share
research
∙
02/28/2021
On the Approximation Ratio of the 3-Opt Algorithm for the (1,2)-TSP
The (1,2)-TSP is a special case of the TSP where each edge has cost eith...
research
∙
02/09/2021
Lower Bounds on the Integraliy Ratio of the Subtour LP for the Traveling Salesman Problem
In this paper we investigate instances with high integrality ratio of th...
research
∙
04/15/2020
A Small Improvement to the Upper Bound on the Integrality Ratio for the s-t Path TSP
In this paper we investigate the integrality ratio of the standard LP re...
research
∙
09/27/2019
On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric TSP
The k-Opt and Lin-Kernighan algorithm are two of the most important loca...
research
∙
09/26/2019
The Approximation Ratio of the 2-Opt Heuristic for the Metric Traveling Salesman Problem
The 2-Opt heuristic is one of the simplest algorithms for finding good s...
research
∙
09/27/2018
Smoothed Analysis of Edge Elimination for Euclidean TSP
One way to speed up the calculation of optimal TSP tours in practice is ...
research
∙
09/27/2018
Probabilistic Analysis of Edge Elimination for Euclidean TSP
One way to speed up the calculation of optimal TSP tours in practice is ...
research
∙
08/08/2018
