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

DOI10.35634/VM220406MaRDI QIDQ5871390zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

dynamic programmingprecedence conditionsroute

Mathematics Subject Classification ID

Dynamic programming (90C39)

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

Cited in

(6)

• The dynamic bowser routing problem
• Minimax routing problem with a system of priority tasks
• On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics
• A bottleneck routing problem with a system of priority tasks
• On a cube and subspace projections
• Some constructions for solving routing problems using decompositions and transformations of target sets

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)