The routing bottlenecks problem (optimization within zones)
From MaRDI portal
Publication:6571121
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)
Cites Work
- An Algorithm for the Traveling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- The traveling salesman problem. I: Theoretical issues
- Title not available (Why is that?)
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
- The traveling salesman problem and its variations.
- In pursuit of the traveling salesman. Mathematics at the limits of computation
- Hybrid control systems and the dynamic traveling salesman problem
- A bottleneck routing problem with a system of priority tasks
- Dynamic programming in the routing problem: decomposition variant
- 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)
