Elements of dynamic programming in extremal routing problems
From MaRDI portal
Publication:463354
DOI10.1134/S0005117914030102zbMATH Open1301.49065MaRDI QIDQ463354FDOQ463354
Authors: A. A. Chentsov, A. G. Chentsov, P. A. Chentsov 
Publication date: 16 October 2014
Published in: Automation and Remote Control (Search for Journal in Brave)
Recommendations
- Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
- On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
- Dynamic programming in the routing problem with constraints and costs depending on a list of tasks
- Problem of successive megalopolis traversal with the precedence conditions
- Routing under constraints: problem of visit to megalopolises
Dynamic programming (90C39) Dynamic programming in optimal control and differential games (49L20) Applications of optimal control and differential games (49N90)
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- A Dynamic Programming Approach to Sequencing Problems
- On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
- The traveling salesman problem. I: Theoretical issues
- A generalized Courier problem with the cost function depending on the list of tasks
- Extremal bottleneck routing problem with constraints in the form of precedence conditions
- The traveling salesman problem. II: Exact methods
- The traveling salesman problem. Approximate algorithms
- An extremal constrained routing problem with internal losses
- Problem of optimal choice of a route under conditions of time discounting
- Extremal routing problem with internal losses
- A parallel procedure of constructing Bellman function in the generalized courier problem with interior works
- Dynamic programming in a nonstationary route problem
- On an iterative procedure for solving a routing problem with constraints
- On a bottleneck routing problem
Cited In (9)
- Route problem with constraints depending on a list of tasks
- Dynamic programming in the routing problem with constraints and costs depending on a list of tasks
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- A discrete-continuous routing problem with precedence constraints
- Solving a routing problem with the aid of an independent computations scheme
- Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
- Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions
- Dynamic programming method in extremal constrained routing problems
- On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
This page was built for publication: Elements of dynamic programming in extremal routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463354)
