Nonoblivious 2-Opt heuristics for the traveling salesman problem

DOI10.1002/net.21512zbMath1338.90345OpenAlexW2047057401MaRDI QIDQ2811309

Uri Yovel, Asaf Levin

Publication date: 10 June 2016

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21512

zbMATH Keywords

TSPheuristicsperformance guaranteeslocal searchapproximation algorithms2-opt

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

The approximation ratio of the 2-Opt heuristic for the metric traveling salesman problem ⋮ Unnamed Item

Uses Software

• TSPLIB
• Concorde

Cites Work

• Theoretical aspects of local search.
• New local search approximation techniques for maximum generalized satisfiability problems
• The Design of Approximation Algorithms
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• TSPLIB—A Traveling Salesman Problem Library
• On Syntactic versus Computational Views of Approximability
• New Results on the Old k-opt Algorithm for the Traveling Salesman Problem
• Approximate Local Search in Combinatorial Optimization
• A Survey of Approximation Results for Local Search Algorithms
• A Randomized Rounding Approach to the Traveling Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Nonoblivious 2-Opt heuristics for the traveling salesman problem