Dynamic programming method in extremal constrained routing problems

DOI10.1134/S1064230710030081MaRDI QIDQ357046zbMATH OpenFDO

Authors 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 programmingiterative solutionprecedence constraintsextremal constrained routing problemsmovement control

Mathematics Subject Classification ID

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

Recommendations

• An extremal constrained routing problem with internal losses
• Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
• On a bottleneck routing problem
• Extremal bottleneck routing problem with constraints in the form of precedence conditions
• Elements of dynamic programming in extremal routing problems

Cites work

• A generalized Courier problem with the cost function depending on the list of tasks
• A modification of the dynamic programming method for the travelling-salesman problem
• An assignment problem
• Dynamic programming method in the generalized courier problem
• Extremal bottleneck routing problem with constraints in the form of precedence conditions
• Hybrid control systems and the dynamic traveling salesman 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
• Solving the routing optimization problem using the dynamic programming method
• The traveling salesman problem. II: Exact methods

Cited in

(11)

• Constrained optimal routing
• Extremal bottleneck routing problem with constraints in the form of precedence conditions
• On an iterative procedure for solving a routing problem with constraints
• Dynamic programming and questions of solvability of route bottleneck problem with resource constraints
• An approach to solution of the movements routing problem with several participants
• Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
• A scheme of independent calculations in a precedence constrained routing problem
• A generalized Courier problem with the cost function depending on the list of tasks
• Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
• An extremal constrained routing problem with internal losses
• Dynamic programming in the routing problem with constraints and costs depending on a list of tasks

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

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