RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2009 Number 1(3), Pages 72–78 (Mi pdm52)

This article is cited in 1 paper

Computational Methods in Discrete Mathematics

Approximate solution of the traveling salesman problem

V. I. Dulkeyt, R. T. Faizullin

Omsk State Technical University, Omck

Abstract: A heuristic algorithm for the approximate solution of traveling salesman problem is proposed in the article.

UDC: 519.7



© Steklov Math. Inst. of RAS, 2026