Routing of displacements with dynamic constraints: ``bottleneck problem
From MaRDI portal
Publication:5266472
Recommendations
- On a bottleneck routing problem
- Dynamic programming in a nonstationary route problem
- Dynamic programming in the generalized bottleneck problem and the start point optimization
- A model of nonadditive routing problem where the costs depend on the set of pending tasks
- Routing under constraints: problem of visit to megalopolises
Cited in
(13)- A bottleneck routing problem with a system of priority tasks
- On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics
- On the question of the optimization of permutations in the problem with dynamic constraints
- On a bottleneck routing problem
- Dynamic programming and questions of solvability of route bottleneck problem with resource constraints
- Dynamic programming in the generalized bottleneck problem and the start point optimization
- A discrete-continuous routing problem with precedence constraints
- About one route problem with interior works
- The dynamic bowser routing problem
- Dynamic programming method in bottleneck tasks distribution problem with equal agents
- Dynamic programming in a nonstationary route problem
- Problem of optimal choice of a route under conditions of time discounting
- A model of nonadditive routing problem where the costs depend on the set of pending tasks
This page was built for publication: Routing of displacements with dynamic constraints: ``bottleneck problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5266472)
