An algorithm for solving large-scale travelling-salesman problems and its numerical implementation

DOI10.1016/0041-5553(87)90021-8MaRDI QIDQ3815887zbMATH OpenOpenAlexFDO

Authors I. Kh. Sigal

Publication date 1987

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(87)90021-8

zbMATH Keywords

large-scale travelling-salesmansuccessive partition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• An algorithm for the approximate solution of a large-scale travelling salesman problem in a plane
• On an algorithm for solving traveling salesman problems of large dimension
• Algorithms for solving the two-criterion large-scale travelling salesman problem
• scientific article; zbMATH DE number 56359
• scientific article; zbMATH DE number 795217

Cited in

(27)

• Reduction techniques providing initial groupings for Euclidean traveling salesman patching algorithms
• Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• Solving large-scale TSP using a fast wedging insertion partitioning approach
• Application of imperialist competitive algorithm on solving the traveling salesman problem
• Algorithms for solving the two-criterion large-scale travelling salesman problem
• Methods for solving fuzzy assignment problems and fuzzy travelling salesman problems with different membership functions
• Method of scaling in approximate solution of the traveling salesman problem
• Fuzzy commercial traveler problem of trapezoidal membership functions within the sort of \(\alpha \) optimum solution using ranking technique
• scientific article; zbMATH DE number 4130188 (Why is no real title available?)
• Developing a procedure to obtain knowledge of optimum solutions in a travelling salesman problem
• scientific article; zbMATH DE number 4191408 (Why is no real title available?)
• Ein partitionierungsalgorithmus zur distanzberechnung auf Verkehrsnetzen
• On an algorithm for solving traveling salesman problems of large dimension
• scientific article; zbMATH DE number 3978857 (Why is no real title available?)
• An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
• scientific article; zbMATH DE number 4053382 (Why is no real title available?)
• scientific article; zbMATH DE number 56359 (Why is no real title available?)
• scientific article; zbMATH DE number 1051038 (Why is no real title available?)
• Algorithm 750: CDT
• scientific article; zbMATH DE number 1947373 (Why is no real title available?)
• An algorithm for the approximate solution of a large-scale travelling salesman problem in a plane
• scientific article; zbMATH DE number 2102010 (Why is no real title available?)
• Solution of a Large-Scale Traveling-Salesman Problem
• A method for solving traveling-salesman problems
• On a linear-programming, combinatorial approach to the traveling-salesman problem
• On the solution of the traveling salesman problem once again

This page was built for publication: An algorithm for solving large-scale travelling-salesman problems and its numerical implementation

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