Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Xianghui Zhong"'
Publikováno v:
SIAM Journal on Computing; 2023, Vol. 52 Issue 4, p841-864, 24p
Autor:
Xianghui Zhong
Publikováno v:
Operations Research Letters. 49:515-521
The ( 1 , 2 )-TSP is a special case of the TSP where each edge has cost either 1 or 2. In this paper we give a lower bound of 3 2 for the approximation ratio of the 2-Opt algorithm for the ( 1 , 2 )-TSP . Moreover, we show that the 3-Opt algorithm ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d55029494e0d08afabac701152d5b8c
https://doi.org/10.1016/j.orl.2021.05.012
https://doi.org/10.1016/j.orl.2021.05.012
Publikováno v:
Operations Research Letters. 48:401-404
The 2-Opt heuristic is one of the simplest algorithms for finding good solutions to the metric Traveling Salesman Problem. It is the key ingredient to the well-known Lin–Kernighan algorithm and often used in practice. So far, only upper and lower b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da4bcc2656bbe7407ca0b38c3d8049fb
https://doi.org/10.1016/j.orl.2020.05.007
https://doi.org/10.1016/j.orl.2020.05.007
Autor:
Xianghui Zhong
Publikováno v:
Operations Research Letters. 48:627-629
In this paper we investigate the integrality ratio of the standard LP relaxation for the Metric s − t Path TSP . We make a near-optimal choice for an auxiliary function used in the analysis of Traub and Vygen which leads to an improved upper bound
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1df8d8b924c7687469b53f772d3cc9c2
https://doi.org/10.1016/j.orl.2020.07.015
https://doi.org/10.1016/j.orl.2020.07.015
Autor:
Xianghui Zhong, Stefan Hougardy
The well known 4/3 conjecture states that the integrality ratio of the subtour LP is at most 4/3 for metric Traveling Salesman instances. We present a family of Euclidean Traveling Salesman instances for which we prove that the integrality ratio of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::26964c5ed57556bdce9f47b4c3eda87b
http://arxiv.org/abs/1808.02859
http://arxiv.org/abs/1808.02859
Autor:
Hougardy, Stefan, Zhong, Xianghui
Publikováno v:
Mathematical Programming Computation; Mar2021, Vol. 13 Issue 1, p51-74, 24p
Publikováno v:
Notices of the American Mathematical Society; Sep2012, Vol. 59 Issue 8, p1117-1119, 3p
Publikováno v:
Forschung; Dec2011, Vol. 36 Issue 4, p26-33, 8p