scientific article

zbMATH Open0734.90105MaRDI QIDQ3363086

A. V. Sapko

Publication date: 1988

Title of this publication is not available (Why is that?)

zbMATH Keywords

traveling salesman problemsapproximate algorithmprogram complexFORTRANclustered traveling salesmandimensional reduction techniquetube-passing problem

Mathematics Subject Classification ID

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

Related Items (5)

Title not available (Why is that?) ⋮ Solution of a Large-Scale Traveling-Salesman Problem ⋮ On the Travelling Salesperson Problem in Many Dimensions ⋮ Fast Heuristics for Large Geometric Traveling Salesman Problems ⋮ Continuous reformulations and heuristics for the Euclidean travelling salesperson 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 Q3363086)