scientific article; zbMATH DE number 4095242

MaRDI QIDQ3821971zbMATH OpenFDO

Authors A. V. Sapko

Publication date 1988

zbMATH Keywords

approximate solutionserror estimationparallel evaluationtraveling salesman

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Programming involving graphs or networks (90C35)

Recommendations

• An algorithm for the multiprocessor assignment problem
• Computational algorithms for the solution of the salesman problem. I: General pattern of classification
• On an algorithm for solving traveling salesman problems of large dimension
• Solving the multiple traveling salesperson problem on regular grids in linear time
• On the solution of traveling salesman problems
• SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS
• Algorithms for the on-line travelling salesman
• Solving large batches of traveling salesman problems with parallel and distributed computing
• An optimal multiprocessor combinatorial auction solver
• Competitive algorithms for the on-line traveling salesman

Cited in

(6)

• The general problem solving algorithm and its implementation
• The approximate solution of the Euclidean traveling salesman problem on a CRAY X-MP
• A distributed implementation of simulated annealing for the travelling salesman problem
• Computational algorithms for the solution of the salesman problem. I: General pattern of classification
• A parallel algorithm for solving the traveling salesman problem by a recurrent neural network
• scientific article; zbMATH DE number 3850854 (Why is no real title available?)

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 Q3821971)