Minimax routing problem with a system of priority tasks
From MaRDI portal
Recommendations
- A bottleneck routing problem with a system of priority tasks
- On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics
- The routing bottlenecks problem (optimization within zones)
- A model of nonadditive routing problem where the costs depend on the set of pending tasks
- Routing under constraints: problem of visit to megalopolises
Cites work
- A bottleneck routing problem with a system of priority tasks
- A Dynamic Programming Approach to Sequencing Problems
- Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
- An Algorithm for the Traveling Salesman Problem
- Dynamic programming and questions of solvability of route bottleneck problem with resource constraints
- Dynamic programming in the routing problem: decomposition variant
- Dynamic Programming Treatment of the Travelling Salesman Problem
- 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 3400017 (Why is no real title available?)
- In pursuit of the traveling salesman. Mathematics at the limits of computation
- The traveling salesman problem and its variations.
- The traveling salesman problem. I: Theoretical issues
- Two-stage dynamic programming in the routing problem with decomposition
Cited in
(2)
This page was built for publication: Minimax routing problem with a system of priority tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6119971)
