scientific article; zbMATH DE number 3978857

MaRDI QIDQ3743141zbMATH OpenFDO

Authors I. Kh. Sigal

Publication date 1985

zbMATH Keywords

numerical experimentsperformance controlsystem of composite algorithmstraveling salesman problem

Mathematics Subject Classification ID

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

Recommendations

• The traveling salesman problem. Approximate algorithms
• scientific article; zbMATH DE number 1051038
• An algorithm for solving large-scale travelling-salesman problems and its numerical implementation
• On an algorithm for solving traveling salesman problems of large dimension
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem

Cited in

(7)

• A genetic algorithm for finding a salesman's route
• Solving TSP through the integration of OR and CP techniques
• Expert systems approach for generalized traveling salesman problem
• scientific article; zbMATH DE number 1051038 (Why is no real title available?)
• scientific article; zbMATH DE number 1390344 (Why is no real title available?)
• Solution of a traveling salesman problem in computer component design
• A sequence for using algorithms for the approximate solution in the hybrid algorithm for solving the travelling salesman problem

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