The routing problems with optimization of the starting point: dynamic programming

DOI10.20537/2226-3594-2019-54-08zbMath1454.90071OpenAlexW2996651528MaRDI QIDQ5134261

P. A. Chentsov, A. G. Chentsov

Publication date: 16 November 2020

Published in: Izvestiya Instituta Matematiki i Informatiki. Udmurt. Gos. Univ. (Search for Journal in Brave)

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

zbMATH Keywords

dynamic programmingrouting problemprecedence conditions

Mathematics Subject Classification ID

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

Related Items (2)

Dynamic programming in the routing problem: decomposition variant ⋮ On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Problem of successive megalopolis traversal with the precedence conditions
• Routing under constraints: problem of visit to megalopolises
• The traveling salesman problem and its variations
• To question of routing of works complexes
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• Оptimization of the Start Point in the Gtsp with the Precedence Conditions
• On one routing task with the optimization of the start-finish point
• Dynamic programming in the generalized bottleneck problem and the start point optimization
• In Pursuit of the Traveling Salesman

This page was built for publication: The routing problems with optimization of the starting point: dynamic programming