On sequential traversal of sets

DOI10.35634/VM210310MaRDI QIDQ5037478zbMATH OpenOpenAlexFDO

Authors A. G. Chentsov, P. A. Chentsov

Publication date 1 March 2022

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

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

zbMATH Keywords

dynamic programmingroute optimizationstart point optimization

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• Problem of successive megalopolis traversal with the precedence conditions
• Routing under constraints: problem of visit to megalopolises
• Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
• To question of routing of works complexes
• On one routing task with the optimization of the start-finish point

Cites work

• A Dynamic Programming Approach to Sequencing Problems
• Dynamic Programming Treatment of the Travelling Salesman Problem
• scientific article; zbMATH DE number 3163006 (Why is no real title available?)
• scientific article; zbMATH DE number 3324725 (Why is no real title available?)
• 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
• On One Routing Problem with Non-Additive Cost Aggregation
• On routing problem with starting point optimization
• Routing under constraints: problem of visit to megalopolises
• 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 the question of optimization of the starting point in the routing problem with restrictions

Cited in

(3)

• On the solution of the problem of the sequential traversing of sets using a ``nonclosed traveling salesman problem.
• Iterating along a Prikry sequence
• On one routing task with the optimization of the start-finish point

This page was built for publication: On sequential traversal of sets

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