The routing bottlenecks problem (optimization within zones)

DOI10.35634/VM240206MaRDI QIDQ6571121FDOQ6571121

Authors A. G. Chentsov, A. A. Chentsov, P. A. Chentsov 

Publication date 11 July 2024

Published in Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingprecedence conditionsroute

Mathematics Subject Classification ID

Dynamic programming (90C39)

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

• scientific article; zbMATH DE number 3163006 (Why is no real title available?)
• A Dynamic Programming Approach to Sequencing Problems
• A bottleneck routing problem with a system of priority tasks
• 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 Treatment of the Travelling Salesman Problem
• Dynamic programming in the routing problem: decomposition variant
• 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 (2)

• On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics
• Minimax routing problem with a system of priority tasks

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)