Dynamic programming and questions of solvability of route bottleneck problem with resource constraints

DOI10.35634/VM220406OpenAlexW4313413145MaRDI QIDQ5871390FDOQ5871390

Authors: A. G. Chentsov, A. A. Chentsov 

Publication date: 19 January 2023

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

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

Recommendations

• Routing of displacements with dynamic constraints: ``bottleneck problem
• On a bottleneck routing problem
• Generalized model of courier with additional restrictions
• Dynamic programming in the generalized bottleneck problem and the start point optimization
• Dynamic programming method in extremal constrained routing problems

zbMATH Keywords

dynamic programmingprecedence conditionsroute

Mathematics Subject Classification ID

Dynamic programming (90C39)

Cited In (5)

• On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics
• On a cube and subspace projections
• A bottleneck routing problem with a system of priority tasks
• The dynamic bowser routing problem
• Minimax routing problem with a system of priority tasks

This page was built for publication: Dynamic programming and questions of solvability of route bottleneck problem with resource constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5871390)