S. I. Sergeev, “Algorithms for the minimax problem of the traveling salesman. I. An approach based on dynamic programming”, Avtomat. i Telemekh., 1995, no. 7, 144–150; Autom. Remote Control, 56:7 (1995), 1027

Avtomatika i Telemekhanika

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Archive
	Impact factor
	Guidelines for authors
	Submit a manuscript

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
	Find

Personal entry:
Login:
Password:
	Save password
	Enter
	Forgotten password?
	Register

Avtomatika i Telemekhanika, 1995, Issue 7, Pages 144–150 (Mi at3684)

This article is cited in 12 scientific papers (total in 12 papers)

Developing Systems

Algorithms for the minimax problem of the traveling salesman. I. An approach based on dynamic programming

S. I. Sergeev

Moscow institute of Economics and Statistics

Full-text PDF (863 kB) Citations (12)

Received: 10.10.1994

Bibliographic databases:

Document Type: Article

UDC: 519.854.2

Language: Russian

Citation: S. I. Sergeev, “Algorithms for the minimax problem of the traveling salesman. I. An approach based on dynamic programming”, Avtomat. i Telemekh., 1995, no. 7, 144–150; Autom. Remote Control, 56:7 (1995), 1027–1032

Citation in format AMSBIB

\Bibitem{Ser95}

\by S.~I.~Sergeev

\paper Algorithms for the minimax problem of the traveling salesman. I.~An approach based on dynamic programming

\jour Avtomat. i Telemekh.

\yr 1995

\issue 7

\pages 144--150

\mathnet{http://mi.mathnet.ru/at3684}

\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=1350634}

\zmath{https://zbmath.org/?q=an:0917.90252}

\transl

\jour Autom. Remote Control

\yr 1995

\vol 56

\issue 7

\pages 1027--1032

Linking options:

https://www.mathnet.ru/eng/at3684

https://www.mathnet.ru/eng/at/y1995/i7/p144

Cycle of papers

Algorithms for the minimax problem of the traveling salesman. I. An approach based on dynamic programming
S. I. Sergeev
Avtomat. i Telemekh., 1995:7, 144–150
Algorithms for the minimax problem of the travelling salesman. II. Dual approach
S. I. Sergeev, A. V. Chernyshenko
Avtomat. i Telemekh., 1995:8, 124–141

This publication is cited in the following 12 articles:

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Registration to the website

Logotypes