On sequential traversal of sets

DOI10.35634/vm210310zbMath1486.90204OpenAlexW3204401547MaRDI QIDQ5037478

P. A. Chentsov, A. G. 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Routing under constraints: problem of visit to megalopolises
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
• The traveling salesman problem and its variations.
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• On One Routing Problem with Non-Additive Cost Aggregation
• ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION
• To the question of optimization of the starting point in the routing problem with restrictions
• In Pursuit of the Traveling Salesman

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