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

DOI10.1016/0895-7177(90)90366-UMaRDI QIDQ583126zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The traveling salesman problem. II: Exact methods
• Nonoblivious 2-opt heuristics for the traveling salesman problem
• On a linear-programming, combinatorial approach to the traveling-salesman problem
• Two Algorithmic Results for the Traveling Salesman Problem
• A two-dimensional mapping for the traveling salesman problem
• scientific article; zbMATH DE number 1855663
• The traveling salesman problem: the spectral radius and the length of an optimal tour
• On the approximability of the traveling salesman problem
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Approximate algorithms for the traveling salesman problem. II

Cites work

• scientific article; zbMATH DE number 3898613 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A Dynamic Programming Approach to Sequencing Problems
• A man-machine approach toward solving the traveling salesman problem
• A restricted Lagrangean approach to the traveling salesman problem
• Algorithms for Large-scale Travelling Salesman Problems
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An Algorithm for the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Approximate Traveling Salesman Algorithms
• Geometric Approaches to Solving the Traveling Salesman Problem
• Solution of a Large-Scale Traveling-Salesman Problem
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• Vehicle Routing with Time Windows

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

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