EEMCS
Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Sitemap
 Search
 Organisation

EEMCS EPrints Service


16095 Average-case approximation ratio of the 2-opt algorithm for the TSP
 Home Policy Brochure Browse Search User Area Contact Help

Engels, C. and Manthey, B. (2009) Average-case approximation ratio of the 2-opt algorithm for the TSP. Operations Research Letters, 37 (2). pp. 83-84. ISSN 0167-6377 *** ISI Impact 0,681 ***

Full text available as:

PDF
 - Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
474 Kb

Official URL: http://dx.doi.org/10.1016/j.orl.2008.12.002

Exported to Metis

Abstract

We show that the 2-opt heuristic for the traveling salesman problem achieves an expected approximation ratio of roughly $O(\sqrt{n})$ for instances with $n$ nodes, where the edge weights are drawn uniformly and independently at random.

Item Type:Article
Research Group:EWI-DMMP: Discrete Mathematics and Mathematical Programming
Research Program:CTIT-IE&ICT: Industrial Engineering and ICT
ID Code:16095
Status:Published
Deposited On:05 October 2009
Refereed:Yes
International:Yes
ISI Impact Factor:0,681
More Information:statisticsmetis

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item