The routing problems with optimization of the starting point: dynamic programming
From MaRDI portal
Recommendations
- On routing problem with starting point optimization
- Routing under constraints: problem of visit to megalopolises
- To the question of optimization of the starting point in the routing problem with restrictions
- Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
- Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
Cites work
- A Dynamic Programming Approach to Sequencing Problems
- Dynamic programming in the generalized bottleneck problem and the start point optimization
- Dynamic Programming Treatment of the Travelling Salesman Problem
- scientific article; zbMATH DE number 3648418 (Why is no real title available?)
- scientific article; zbMATH DE number 3163006 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3264065 (Why is no real title available?)
- In pursuit of the traveling salesman. Mathematics at the limits of computation
- On one routing task with the optimization of the start-finish point
- Optimization of the start point in the GTSP with the precedence conditions
- Problem of successive megalopolis traversal with the precedence conditions
- Routing under constraints: problem of visit to megalopolises
- The traveling salesman problem and its variations
- To question of routing of works complexes
Cited in
(11)- On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
- Solving the routing optimization problem using the dynamic programming method
- scientific article; zbMATH DE number 4059093 (Why is no real title available?)
- On routing problem with starting point optimization
- Some applications of optimization routing problems with additional constraints
- Dynamic programming in the routing problem: decomposition variant
- On the question of the optimization of permutations in the problem with dynamic constraints
- On one routing task with the optimization of the start-finish point
- To the question of optimization of the starting point in the routing problem with restrictions
- Dynamic programming in the generalized bottleneck problem and the start point optimization
- Two-stage dynamic programming in the routing problem with decomposition
This page was built for publication: The routing problems with optimization of the starting point: dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5134261)
