Dynamic programming and decomposition in extreme routing problems
From MaRDI portal
Cites work
- A bottleneck routing problem with a system of priority tasks
- A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
- Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
- Dynamic programming in the generalized bottleneck problem and the start point optimization
- Dynamic programming in the routing problem: decomposition variant
- Generalized model of courier with additional restrictions
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3264065 (Why is no real title available?)
- scientific article; zbMATH DE number 3400017 (Why is no real title available?)
- In pursuit of the traveling salesman. Mathematics at the limits of computation
- One task of routing jobs in high radiation conditions
- Routing under constraints: problem of visit to megalopolises
- The routing bottlenecks problem (optimization within zones)
- The traveling salesman problem and its variations
- The traveling salesman problem. I: Theoretical issues
- To question of routing of works complexes
- Two-stage dynamic programming in the routing problem with decomposition
Cited in
(2)
This page was built for publication: Dynamic programming and decomposition in extreme routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6836038)
