Dynamic programming method in extremal constrained routing problems

DOI10.1134/S1064230710030081zbMath1272.49044MaRDI QIDQ357046

A. G. Chentsov

Publication date: 29 July 2013

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingprecedence constraintsiterative solutionextremal constrained routing problemsmovement control

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)

Related Items (2)

Dynamic programming in the routing problem with constraints and costs depending on a list of tasks ⋮ Dynamic programming in the routing problem with complex dependence of costs on the list of jobs

Cites Work

• Dynamic programming method in the generalized courier problem
• Extremal bottleneck routing problem with constraints in the form of precedence conditions
• The traveling salesman problem. II: Exact methods
• Hybrid control systems and the dynamic traveling salesman problem
• An assignment problem
• On a generalization of the bottleneck traveling salesman problem
• On the solution of the problem of the sequential traversing of sets using a ``nonclosed traveling salesman problem.
• Reduction of route optimization problems
• A generalized Courier problem with the cost function depending on the list of tasks
• Solving the routing optimization problem using the dynamic programming method
• A modification of the dynamic programming method for the travelling-salesman problem

This page was built for publication: Dynamic programming method in extremal constrained routing problems