Determination of the candidate arc set for the asymmetric traveling salesman problem

DOI10.1016/J.COR.2003.09.011MaRDI QIDQ2485161zbMATH OpenOpenAlexFDO

Authors Sang-Ho Kwon, Hun-Tae Kim, Maing-Kyu Kang

Publication date 3 August 2005

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2003.09.011

zbMATH Keywords

candidate arc setheuristicout-of-kiltertraveling salesman

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Application of the out-of-kilter algorithm to the asymmetric traveling salesman problem
• scientific article; zbMATH DE number 4152160
• scientific article; zbMATH DE number 2243051
• SELECTION OF RELAXATION PROBLEMS FOR A CLASS OF ASYMMETRIC TRAVELING SALESMAN PROBLEM INSTANCES
• Construction heuristics for the asymmetric TSP.

Cites work

• A modified Lin--Kernighan traveling-salesman heuristic
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Application of the out-of-kilter algorithm to the asymmetric traveling salesman problem
• Computer Solutions of the Traveling Salesman Problem
• Construction heuristics for the asymmetric TSP.
• scientific article; zbMATH DE number 1102774 (Why is no real title available?)
• scientific article; zbMATH DE number 2064413 (Why is no real title available?)
• scientific article; zbMATH DE number 1893558 (Why is no real title available?)
• scientific article; zbMATH DE number 758733 (Why is no real title available?)
• scientific article; zbMATH DE number 871931 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• Local Search for the Asymmetric Traveling Salesman Problem
• Network flows. Theory, algorithms, and applications.
• New edges not used in shortest tours of TSP
• The granular tabu search and its application to the vehicle-routing problem
• The traveling salesman. Computational solutions for RSP applications
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(2)

• Application of the out-of-kilter algorithm to the asymmetric traveling salesman problem
• scientific article; zbMATH DE number 2243051 (Why is no real title available?)

Describes a project that uses

Uses Software

• LKH
• VRP
• TSPLIB

This page was built for publication: Determination of the candidate arc set for the asymmetric traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485161)