Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization-Reference-Cited by-同舟云学术

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

Published:2019-01 Issue:1 Volume:272 Page:32-42
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Salii Yaroslav

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference57 articles.

1. The transitive reduction of a directed graph;Aho;SIAM Journal on Computing,1972

2. A new generalization of the traveling salesman problem;Alkaya;Applied and Computational Mathematics,2010

3. The third comprehensive survey on scheduling problems with setup times/costs;Allahverdi;European Journal of Operational Research,2015

4. A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints;Ascheuer;Computational Optimization and Applications,2000

5. The precedence-constrained asymmetric traveling salesman polytope;Balas;Mathematical programming,1995

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

1. Combining a Parallel Branch-and-Bound Algorithm with a Strong Heuristic to Solve the Sequential Ordering Problem;Proceedings of the 52nd International Conference on Parallel Processing Workshops;2023-08-07

2. A parallel branch-and-bound algorithm with history-based domination and its application to the sequential ordering problem;Journal of Parallel and Distributed Computing;2023-02

3. Development of Methods for Route Optimization of Work in Inhomogeneous Radiation Fields to Minimize the Dose Load of Personnel;Energies;2022-06-29

4. Task Roadmaps: Speeding up Task Replanning;Frontiers in Robotics and AI;2022-04-28

5. A hybrid genetic algorithm, list-based simulated annealing algorithm, and different heuristic algorithms for travelling salesman problem;Logic Journal of the IGPL;2022-02-28