Minimax routing problem with a system of priority tasks

DOI10.35634/2226-3594-2023-62-08OpenAlexW4389145810MaRDI QIDQ6119971

Alekseĭ Aleksandrovich Chentsov, A. G. Chentsov

Publication date: 20 February 2024

Published in: Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/iimi456

zbMATH Keywords

dynamic programmingdecompositionroute

Mathematics Subject Classification ID

Dynamic programming (90C39)

Cites Work

• The traveling salesman problem. I: Theoretical issues
• Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
• The traveling salesman problem and its variations.
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• Dynamic programming in the routing problem: decomposition variant
• An Algorithm for the Traveling Salesman Problem
• Dynamic programming and questions of solvability of route bottleneck problem with resource constraints
• In Pursuit of the Traveling Salesman
• Two-stage dynamic programming in the routing problem with decomposition
• A bottleneck routing problem with a system of priority tasks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimax routing problem with a system of priority tasks