Standard

An exact algorithm with linear complexity for a problem of visiting megalopolises. / Chentsov, A. G.; Khachai, M. Yu; Khachai, D. M.
In: Proceedings of the Steklov Institute of Mathematics, Vol. 295, 01.12.2016, p. 38-46.

Research output: Contribution to journal › Article › peer-review

Harvard

Chentsov, AG, Khachai, MY & Khachai, DM 2016, 'An exact algorithm with linear complexity for a problem of visiting megalopolises', Proceedings of the Steklov Institute of Mathematics, vol. 295, pp. 38-46. https://doi.org/10.1134/S0081543816090054

APA

Chentsov, A. G., Khachai, M. Y., & Khachai, D. M. (2016). An exact algorithm with linear complexity for a problem of visiting megalopolises. Proceedings of the Steklov Institute of Mathematics, 295, 38-46. https://doi.org/10.1134/S0081543816090054

Vancouver

Chentsov AG, Khachai MY, Khachai DM. An exact algorithm with linear complexity for a problem of visiting megalopolises. Proceedings of the Steklov Institute of Mathematics. 2016 Dec 1;295:38-46. doi: 10.1134/S0081543816090054

Author

Chentsov, A. G. ; Khachai, M. Yu ; Khachai, D. M. / An exact algorithm with linear complexity for a problem of visiting megalopolises. In: Proceedings of the Steklov Institute of Mathematics. 2016 ; Vol. 295. pp. 38-46.

BibTeX

@article{2ee42ff88f04470ca9db2eeecf21b0a5,
title = "An exact algorithm with linear complexity for a problem of visiting megalopolises",
keywords = "dynamic programming, NP-hard problem, precedence relations, traveling salesman problem",
author = "Chentsov, {A. G.} and Khachai, {M. Yu} and Khachai, {D. M.}",
year = "2016",
month = dec,
day = "1",
doi = "10.1134/S0081543816090054",
language = "English",
volume = "295",
pages = "38--46",
journal = "Proceedings of the Steklov Institute of Mathematics",
issn = "0081-5438",
publisher = "Pleiades Publishing",

}

RIS

TY - JOUR

T1 - An exact algorithm with linear complexity for a problem of visiting megalopolises

AU - Chentsov, A. G.

AU - Khachai, M. Yu

AU - Khachai, D. M.

PY - 2016/12/1

Y1 - 2016/12/1

KW - dynamic programming

KW - NP-hard problem

KW - precedence relations

KW - traveling salesman problem

UR - http://www.scopus.com/inward/record.url?scp=85010430812&partnerID=8YFLogxK

UR - https://elibrary.ru/item.asp?id=29475500

UR - https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=tsmetrics&SrcApp=tsm_test&DestApp=WOS_CPL&DestLinkType=FullRecord&KeyUT=000394441400005

U2 - 10.1134/S0081543816090054

DO - 10.1134/S0081543816090054

M3 - Article

AN - SCOPUS:85010430812

VL - 295

SP - 38

EP - 46

JO - Proceedings of the Steklov Institute of Mathematics

JF - Proceedings of the Steklov Institute of Mathematics

SN - 0081-5438

ER -

ID: 1478869