Study of an algorithm for solving the travelling salesman problem

DOI10.1016/0041-5553(73)90042-6zbMATH Open0288.90059OpenAlexW1966142046MaRDI QIDQ4777064FDOQ4777064

Authors: V. K. Leont'ev 

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1016/0041-5553(73)90042-6

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cited In (2)

• SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts
• Three value TSP and linkages with the three value linear spanning 2-forests

This page was built for publication: Study of an algorithm for solving the travelling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4777064)