Dynamic programming in the routing problem: decomposition variant

DOI10.20310/2686-9667-2022-27-137-95-124OpenAlexW4226240865MaRDI QIDQ5097703

A. G. Chentsov, P. A. Chentsov

Publication date: 31 August 2022

Published in: Russian Universities Reports. Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

dynamic programmingprecedence conditionsroute

Mathematics Subject Classification ID

Optimal feedback synthesis (49N35) Dynamic programming (90C39) Problems with incomplete information (optimization) (49N30)

Related Items (3)

Two-stage dynamic programming in the routing problem with decomposition ⋮ Minimax routing problem with a system of priority tasks ⋮ A bottleneck routing problem with a system of priority tasks

Cites Work

• Unnamed Item
• Routing under constraints: problem of visit to megalopolises
• Procedures for travelling salesman problems with additional constraints
• New classes of efficiently solvable generalized traveling salesman problems
• The traveling salesman problem and its variations
• Approximation schemes for the generalized traveling salesman problem
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
• Extremal routing problem with internal losses
• To question of routing of works complexes
• THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
• The routing problems with optimization of the starting point: dynamic programming
• In Pursuit of the Traveling Salesman

This page was built for publication: Dynamic programming in the routing problem: decomposition variant