Experimental comparison of two heuristic algorithms for one generalization of the large-scale planar travelling-salesman problem

zbMath0742.90080MaRDI QIDQ1183812

A. V. Sherstyuk, D. S. Gershuni

Publication date: 28 June 1992

Published in: Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

approximate algorithmsinteger-valued planar grid

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

This page was built for publication: Experimental comparison of two heuristic algorithms for one generalization of the large-scale planar travelling-salesman problem