Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
From MaRDI portal
Publication:5385935
DOI10.1007/11922377_8zbMath1137.90647OpenAlexW1551991222MaRDI QIDQ5385935
Gerold Jäger, Paul Molitor, Boris I. Goldengorin
Publication date: 17 April 2008
Published in: Combinatorial and Algorithmic Aspects of Networking (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11922377_8
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (6)
Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics ⋮ The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems ⋮ Extending single tolerances to set tolerances ⋮ The effect of the asymmetry of road transportation networks on the traveling salesman problem ⋮ Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP ⋮ Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
Uses Software
This page was built for publication: Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
