Dynamic programming in the routing problem: decomposition variant

DOI10.20310/2686-9667-2022-27-137-95-124MaRDI QIDQ5097703zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Two-stage dynamic programming in the routing problem with decomposition
• The routing problems with optimization of the starting point: dynamic programming
• On the question of the optimization of permutations in the problem with dynamic constraints
• Local dynamic programming incuts in routing problems with restrictions

Cites work

• Approximation schemes for the generalized traveling salesman problem
• Extremal routing problem with internal losses
• scientific article; zbMATH DE number 3324725 (Why is no real title available?)
• In pursuit of the traveling salesman. Mathematics at the limits of computation
• New classes of efficiently solvable generalized traveling salesman problems
• Procedures for travelling salesman problems with additional constraints
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
• Routing under constraints: problem of visit to megalopolises
• THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
• The routing problems with optimization of the starting point: dynamic programming
• The traveling salesman problem and its variations
• To question of routing of works complexes

Cited in

(8)

• A decomposition algorithm for circuit routing
• 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
• The routing bottlenecks problem (optimization within zones)
• Dynamic programming and decomposition in extreme routing problems
• Some constructions for solving routing problems using decompositions and transformations of target sets
• Dynamic programming in multi-level routing problems with constraints

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

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