Standard

On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks. / Chentsov, A. A.; Chentsov, A. A.; Sesekin, A. N.
In: Proceedings of the Steklov Institute of Mathematics, Vol. 315, No. SUPPL 1, 12.2021, p. S67-S80.

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

Harvard

Chentsov, AA, Chentsov, AA & Sesekin, AN 2021, 'On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks', Proceedings of the Steklov Institute of Mathematics, vol. 315, no. SUPPL 1, pp. S67-S80. https://doi.org/10.1134/S0081543821060067

APA

Chentsov, A. A., Chentsov, A. A., & Sesekin, A. N. (2021). On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks. Proceedings of the Steklov Institute of Mathematics, 315(SUPPL 1), S67-S80. https://doi.org/10.1134/S0081543821060067

Vancouver

Chentsov AA, Chentsov AA, Sesekin AN. On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks. Proceedings of the Steklov Institute of Mathematics. 2021 Dec;315(SUPPL 1):S67-S80. doi: 10.1134/S0081543821060067

Author

Chentsov, A. A. ; Chentsov, A. A. ; Sesekin, A. N. / On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks. In: Proceedings of the Steklov Institute of Mathematics. 2021 ; Vol. 315, No. SUPPL 1. pp. S67-S80.

BibTeX

@article{73a230c4ccdc4f31be24854068506b70,
title = "On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks",
keywords = "Bellman function, dynamic programming, route, TRAVELING SALESMAN PROBLEM, TOOL PATH PROBLEM, OPTIMIZATION, MODEL",
author = "Chentsov, {A. A.} and Chentsov, {A. A.} and Sesekin, {A. N.}",
note = "Publisher Copyright: {\textcopyright} 2021, Pleiades Publishing, Ltd.",
year = "2021",
month = dec,
doi = "10.1134/S0081543821060067",
language = "English",
volume = "315",
pages = "S67--S80",
journal = "Proceedings of the Steklov Institute of Mathematics",
issn = "0081-5438",
publisher = "Pleiades Publishing",
number = "SUPPL 1",

}

RIS

TY - JOUR

T1 - On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks

AU - Chentsov, A. A.

AU - Chentsov, A. A.

AU - Sesekin, A. N.

N1 - Publisher Copyright: © 2021, Pleiades Publishing, Ltd.

PY - 2021/12

Y1 - 2021/12

KW - Bellman function

KW - dynamic programming

KW - route

KW - TRAVELING SALESMAN PROBLEM

KW - TOOL PATH PROBLEM

KW - OPTIMIZATION

KW - MODEL

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

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

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

U2 - 10.1134/S0081543821060067

DO - 10.1134/S0081543821060067

M3 - Article

AN - SCOPUS:85123059728

VL - 315

SP - S67-S80

JO - Proceedings of the Steklov Institute of Mathematics

JF - Proceedings of the Steklov Institute of Mathematics

SN - 0081-5438

IS - SUPPL 1

ER -

ID: 29476017