Dynamic programming in the generalized bottleneck problem and the start point optimization

DOI10.20537/VM180306MaRDI QIDQ5224167zbMATH OpenOpenAlexWikidataFDO

Authors A. G. Chentsov, A. A. Chentsov, A. N. Sesekin

Publication date 19 July 2019

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

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

zbMATH Keywords

dynamic programmingroute optimizationstart point optimization

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• Routing of displacements with dynamic constraints: ``bottleneck problem
• On a bottleneck routing problem
• The dynamic programming method in the generalized traveling salesman problem
• The routing problems with optimization of the starting point: dynamic programming
• 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?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
• In pursuit of the traveling salesman. Mathematics at the limits of computation
• On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
• Routing of displacements with dynamic constraints: ``bottleneck problem
• The traveling salesman problem and its variations.
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• To question of routing of works complexes

Cited in

(10)

• On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics
• To the question of optimization of the starting point in the routing problem with restrictions
• The routing problems with optimization of the starting point: dynamic programming
• On a bottleneck routing problem
• Routing of displacements with dynamic constraints: ``bottleneck problem
• On routing problem with starting point optimization
• Dynamic programming and questions of solvability of route bottleneck problem with resource constraints
• A bottleneck routing problem with a system of priority tasks
• Dynamic programming method in bottleneck tasks distribution problem with equal agents
• On the question of the optimization of permutations in the problem with dynamic constraints

This page was built for publication: Dynamic programming in the generalized bottleneck problem and the start point optimization

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