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

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

Original language	English
Pages (from-to)	32-42
Number of pages	11
Journal	European Journal of Operational Research
Volume	272
Issue number	1
DOIs	https://doi.org/10.1016/j.ejor.2018.06.003
Publication status	Published - 1 Jan 2019

Complexity, Dynamic programming, Precedence constraints, Time dependence, Traveling salesman problem, BRANCH, GRAPH, SEQUENCING PROBLEMS, ROUTING-PROBLEMS, ALGORITHM, SCHEDULING PROBLEMS, STRATEGIES, SEQUENTIAL ORDERING PROBLEM, SYSTEMS

ID: 7887915