Dynamic Programming for the Minimum Tour Duration Problem-Reference-Cited by-同舟云学术

Dynamic Programming for the Minimum Tour Duration Problem

Published:2017-05 Issue:2 Volume:51 Page:549-565
ISSN:0041-1655
Container-title:Transportation Science
language:en
Short-container-title:Transportation Science

Author:

Tilk Christian¹,Irnich Stefan¹

Affiliation:

1. Gutenberg School of Management and Economics, Johannes Gutenberg University Mainz, D-55128 Mainz, Germany

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Transportation,Civil and Structural Engineering

Link

https://pubsonline.informs.org/doi/pdf/10.1287/trsc.2015.0626

Reference34 articles.

1. Ascheuer N (1995) Hamiltonian path problems in the on-line optimization of flexible manufacturing systems. Doctoral thesis, Technische Universität Berlin, Berlin.

2. Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut

3. Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem

4. Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks;Discrete Optimization;2024-08

2. Decremental State-Space Relaxations for the Basic Traveling Salesman Problem with a Drone;INFORMS Journal on Computing;2024-07

3. A general variable neighborhood search for the traveling salesman problem with time windows under various objectives;Discrete Applied Mathematics;2024-03

4. On Improving Widyantoro’s Dynamic Programming for Forward-Backward Combination Method;2023 Eighth International Conference on Informatics and Computing (ICIC);2023-12-08

5. Dynamics between warehouse operations and vehicle routing;Production and Operations Management;2023-11