Xianghui Zhong

Publication Activity (10 Years)

Years Active: 2018-2023
Publications (10 Years): 14

Top Topics

Approximation Ratio

Ant Colony Optimization

Traveling Salesman

Top Venues

Oper. Res. Lett.

Math. Program. Comput.

Publications

Ulrich A. Brodowsky, Stefan Hougardy, Xianghui Zhong
-Opt Heuristic for the Euclidean Traveling Salesman Problem. SIAM J. Comput. 52 (4) (2023)
Xianghui Zhong
On the Approximation Ratio of the 3-Opt Algorithm for the (1, 2)-TSP. CoRR (2021)
Stefan Hougardy, Xianghui Zhong
Hard to solve instances of the Euclidean Traveling Salesman Problem. Math. Program. Comput. 13 (1) (2021)
Xianghui Zhong
Lower Bounds on the Integraliy Ratio of the Subtour LP for the Traveling Salesman Problem. CoRR (2021)
Ulrich A. Brodowsky, Stefan Hougardy, Xianghui Zhong
The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem. CoRR (2021)
Xianghui Zhong
On the approximation ratio of the 3-Opt algorithm for the (1, 2)-TSP. Oper. Res. Lett. 49 (4) (2021)
Xianghui Zhong
A Small Improvement to the Upper Bound on the Integrality Ratio for the s-t Path TSP. CoRR (2020)
Xianghui Zhong
Slightly improved upper bound on the integrality ratio for the s-t Path TSP. Oper. Res. Lett. 48 (5) (2020)
Stefan Hougardy, Fabian Zaiser, Xianghui Zhong
The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem. Oper. Res. Lett. 48 (4) (2020)
Xianghui Zhong
On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric and Graph TSP. ESA (2020)
Xianghui Zhong
On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric TSP. CoRR (2019)
Stefan Hougardy, Fabian Zaiser, Xianghui Zhong
The Approximation Ratio of the 2-Opt Heuristic for the Metric Traveling Salesman Problem. CoRR (2019)
Stefan Hougardy, Xianghui Zhong
Hard to Solve Instances of the Euclidean Traveling Salesman Problem. CoRR (2018)
Xianghui Zhong
Probabilistic Analysis of Edge Elimination for Euclidean TSP. CoRR (2018)