Dynamic programming in a nonstationary route problem
From MaRDI portal
Recommendations
- Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
- The dynamic programming method in the generalized traveling salesman problem
- Routing of displacements with dynamic constraints: ``bottleneck problem
- Solving the routing optimization problem using the dynamic programming method
- Routing under constraints: problem of visit to megalopolises
Cited in
(10)- Elements of dynamic programming in extremal routing problems
- Problem of successive megalopolis traversal with the precedence conditions
- Solving the routing optimization problem using the dynamic programming method
- Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
- Routing of displacements with dynamic constraints: ``bottleneck problem
- On the optimization of pit stop strategies via dynamic programming
- An extremal constrained routing problem with internal losses
- Problem of optimal choice of a route under conditions of time discounting
- Letter to the editor: A variant on the shortest-route problem
- The dynamic bowser routing problem
This page was built for publication: Dynamic programming in a nonstationary route problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931680)
