A diagonal completion and 2-optimal procedure for the travelling salesman problem
From MaRDI portal
Publication:583126
DOI10.1016/0895-7177(90)90366-UzbMATH Open0691.90091OpenAlexW1997511600MaRDI QIDQ583126FDOQ583126
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
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
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- An Algorithm for the Traveling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- Solution of a Large-Scale Traveling-Salesman Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Title not available (Why is that?)
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Vehicle Routing with Time Windows
- Algorithms for Large-scale Travelling Salesman Problems
- A restricted Lagrangean approach to the traveling salesman problem
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Approximate Traveling Salesman Algorithms
- Geometric Approaches to Solving the Traveling Salesman Problem
- A man-machine approach toward solving the traveling salesman problem
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)
