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

Research output: Contribution to journalArticleResearchpeer-review

Original languageEnglish
Pages (from-to)32-42
Number of pages11
JournalEuropean Journal of Operational Research
Volume272
Issue number1
DOIs
Publication statusPublished - 1 Jan 2019

Fingerprint

Traveling salesman problem
Travelling salesman problems
Dynamic programming
Dynamic Programming
Cost Function
Optimality Principle
Aggregation Function
Precedence Constraints
Cost functions
Directed Acyclic Graph
Partial Order
Agglomeration
Time Complexity
Generalization
Heuristics
Upper bound
Costs
Estimate

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

ASJC Scopus subject areas

  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

WoS ResearchAreas Categories

  • Management
  • Operations Research & Management Science

Cite this

@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 = "1",
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",

}

Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization. / Salii, Yaroslav.

In: European Journal of Operational Research, Vol. 272, No. 1, 01.01.2019, p. 32-42.

Research output: Contribution to journalArticleResearchpeer-review

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

VL - 272

SP - 32

EP - 42

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -