On routing problem with starting point optimization

DOI10.15826/UMJ.2020.2.005MaRDI QIDQ4986290zbMATH OpenOpenAlexFDO

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

Publication date 27 April 2021

Published in Ural mathematical journal (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

dynamic programmingprecedence conditionsroute

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• 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 one routing task with the optimization of the start-finish point
• Optimization of the start point in the GTSP with the precedence conditions
• Dynamic programming in the generalized bottleneck problem and the start point optimization

Cites work

• A Dynamic Programming Approach to Sequencing Problems
• An Algorithm for the Traveling Salesman Problem
• Dynamic Programming Treatment of the Travelling Salesman Problem
• scientific article; zbMATH DE number 3648418 (Why is no real title available?)
• scientific article; zbMATH DE number 3163006 (Why is no real title available?)
• scientific article; zbMATH DE number 3264065 (Why is no real title available?)
• In pursuit of the traveling salesman. Mathematics at the limits of computation
• 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 question of routing of works complexes
• To the question of optimization of the starting point in the routing problem with restrictions

Cited in

(5)

• Optimization of the start point in the GTSP with the precedence conditions
• On sequential traversal of sets
• On one routing task with the optimization of the start-finish point
• The routing problems with optimization of the starting point: dynamic programming
• To the question of optimization of the starting point in the routing problem with restrictions

This page was built for publication: On routing problem with starting point optimization

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