Standard

Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization. / Salii, Yaroslav.
в: European Journal of Operational Research, Том 272, № 1, 01.01.2019, стр. 32-42.

Результаты исследований: Вклад в журнал › Статья › Рецензирование

Harvard

Salii, Y 2019, 'Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization', European Journal of Operational Research, Том. 272, № 1, стр. 32-42. https://doi.org/10.1016/j.ejor.2018.06.003

APA

Salii, Y. (2019). Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization. European Journal of Operational Research, 272(1), 32-42. https://doi.org/10.1016/j.ejor.2018.06.003

Vancouver

Salii Y. Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization. European Journal of Operational Research. 2019 янв. 1;272(1):32-42. doi: 10.1016/j.ejor.2018.06.003

Author

Salii, Yaroslav. / Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization. в: European Journal of Operational Research. 2019 ; Том 272, № 1. стр. 32-42.

BibTeX

@article{b6ea6ca00e4d4385ba9711f3a49f4ea1,
title = "Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization",
keywords = "Complexity, Dynamic programming, Precedence constraints, Time dependence, Traveling salesman problem, BRANCH, GRAPH, SEQUENCING PROBLEMS, ROUTING-PROBLEMS, ALGORITHM, SCHEDULING PROBLEMS, STRATEGIES, SEQUENTIAL ORDERING PROBLEM, SYSTEMS",
author = "Yaroslav Salii",
year = "2019",
month = jan,
day = "1",
doi = "10.1016/j.ejor.2018.06.003",
language = "English",
volume = "272",
pages = "32--42",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "1",

}

RIS

TY - JOUR

T1 - Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization

AU - Salii, Yaroslav

PY - 2019/1/1

Y1 - 2019/1/1

KW - Complexity

KW - Dynamic programming

KW - Precedence constraints

KW - Time dependence

KW - Traveling salesman problem

KW - BRANCH

KW - GRAPH

KW - SEQUENCING PROBLEMS

KW - ROUTING-PROBLEMS

KW - ALGORITHM

KW - SCHEDULING PROBLEMS

KW - STRATEGIES

KW - SEQUENTIAL ORDERING PROBLEM

KW - SYSTEMS

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

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

U2 - 10.1016/j.ejor.2018.06.003

DO - 10.1016/j.ejor.2018.06.003

M3 - Article

AN - SCOPUS:85049462856

VL - 272

SP - 32

EP - 42

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -

ID: 7887915