The routing bottlenecks problem (optimization within zones)
From MaRDI portal
(Redirected from Publication:6571121)
Recommendations
- A bottleneck routing problem with a system of priority tasks
- On a bottleneck routing problem
- On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics
- Minimax routing problem with a system of priority tasks
- A model of nonadditive routing problem where the costs depend on the set of pending tasks
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 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?)
- Hybrid control systems and the dynamic traveling salesman problem
- In pursuit of the traveling salesman. Mathematics at the limits of computation
- Minimax routing problem with a system of priority tasks
- The traveling salesman problem and its variations.
- The traveling salesman problem. I: Theoretical issues
Cited in
(4)- Minimax routing problem with a system of priority tasks
- On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics
- Dynamic programming and decomposition in extreme routing problems
- Some constructions for solving routing problems using decompositions and transformations of target sets
This page was built for publication: The routing bottlenecks problem (optimization within zones)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571121)
