scientific article; zbMATH DE number 4093206

MaRDI QIDQ3820397zbMATH OpenFDO

Authors G. R. Hainatski

Publication date 1989

zbMATH Keywords

connected processorsheuristiclarge-scale problemmaster processorparallel realizationtravelling salesman

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Theory of operating systems (68N25) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35)

Recommendations

• New parallel randomized algorithms for the traveling salesman problem
• scientific article; zbMATH DE number 1225029
• A new hybrid heuristic approach for solving large traveling salesman problem
• scientific article; zbMATH DE number 1703862
• A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem
• SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS
• A new heuristic for the traveling salesman problem
• The parallel complexity of TSP heuristics
• A new heuristic algorithm for multiple traveling Salesman problem

Cited in

(8)

• The approximate solution of the Euclidean traveling salesman problem on a CRAY X-MP
• New parallel randomized algorithms for the traveling salesman problem
• Divide and conquer strategies for parallel TSP heuristics
• scientific article; zbMATH DE number 1703862 (Why is no real title available?)
• SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS
• Paralell evolution heuristic approach for the traveling salesman problem
• scientific article; zbMATH DE number 2078921 (Why is no real title available?)
• The parallel complexity of TSP heuristics

This page was built for publication:

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