A diagonal completion and 2-optimal procedure for the travelling salesman problem

DOI10.1016/0895-7177(90)90366-UzbMath0691.90091OpenAlexW1997511600MaRDI QIDQ583126

Jianyong Qiao, Sumit K. Garg

Publication date: 1990

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(90)90366-u

zbMATH Keywords

travelling salesman2-optimal methodfast diagonal completion algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A Dynamic Programming Approach to Sequencing Problems
• Vehicle Routing with Time Windows
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• Approximate Traveling Salesman Algorithms
• A restricted Lagrangean approach to the traveling salesman problem
• Geometric Approaches to Solving the Traveling Salesman Problem
• Solution of a Large-Scale Traveling-Salesman Problem
• An Algorithm for the Traveling Salesman Problem
• A man-machine approach toward solving the traveling salesman problem
• Algorithms for Large-scale Travelling Salesman Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: A diagonal completion and 2-optimal procedure for the travelling salesman problem