A sequence for using algorithms for the approximate solution in the hybrid algorithm for solving the travelling salesman problem

DOI10.1016/S0041-5553(89)80010-2zbMath0719.90088MaRDI QIDQ5752306

I. Kh. Sigal

Publication date: 1989

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

zbMATH Keywords

travelling salesmanapproximate algorithmsgiven initial tour

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

This page was built for publication: A sequence for using algorithms for the approximate solution in the hybrid algorithm for solving the travelling salesman problem