Iterative patching and the asymmetric traveling salesman problem

DOI10.1016/j.disopt.2005.10.005zbMath1109.90069OpenAlexW2023483328MaRDI QIDQ2494813

Marcel Turkensteen, Gerard Sierksma, Diptesh Ghosh, Boris I. Goldengorin

Publication date: 30 June 2006

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2005.10.005

zbMATH Keywords

branch-and-boundpatchingasymmetric traveling salesman problemupper bounding

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (1)

A Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improving the Hungarian assignment algorithm
• Embedding branch and bound within evolutionary algorithms
• A new memetic algorithm for the asymmetric traveling salesman problem
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• Exact solution of large-scale, asymmetric traveling salesman problems
• A Gentle Introduction to Memetic Algorithms
• Construction heuristics for the asymmetric TSP.
• Evaluation of The Contract Or-Patch Heuristic Eor The Asymmetric Tsp¹

This page was built for publication: Iterative patching and the asymmetric traveling salesman problem