| The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem S Hougardy, F Zaiser, X Zhong Operations Research Letters 48 (4), 401-404, 2020 | 45 | 2020 |
| Hard to solve instances of the Euclidean Traveling Salesman Problem S Hougardy, X Zhong Mathematical Programming Computation 13, 51-74, 2021 | 31 | 2021 |
| On the approximation ratio of the 3-Opt algorithm for the (1, 2)-TSP X Zhong Operations Research Letters 49 (4), 515-521, 2021 | 8 | 2021 |
| The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem UA Brodowsky, S Hougardy, X Zhong SIAM Journal on Computing 52 (4), 841-864, 2023 | 7 | 2023 |
| On the Approximation Ratio of the -Opt and Lin-Kernighan Algorithm X Zhong arXiv preprint arXiv:1909.12755, 2019 | 4 | 2019 |
| Slightly improved upper bound on the integrality ratio for the s− t Path TSP X Zhong Operations Research Letters 48 (5), 627-629, 2020 | 3 | 2020 |
| Lower Bounds on the Integraliy Ratio of the Subtour LP for the Traveling Salesman Problem X Zhong arXiv preprint arXiv:2102.04765, 2021 | 2 | 2021 |
| Approximation Algorithms for the Traveling Salesman Problem X Zhong Universitäts-und Landesbibliothek Bonn, 2021 | 1 | 2021 |
| Probabilistic analysis of edge elimination for Euclidean TSP X Zhong arXiv preprint arXiv:1809.10469, 2018 | 1 | 2018 |
| On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric and Graph TSP X Zhong 28th Annual European Symposium on Algorithms (ESA 2020) 173, 83:1--83:13, 2020 | | 2020 |
