Elements of dynamic programming in extremal routing problems

DOI10.1134/S0005117914030102zbMath1301.49065MaRDI QIDQ463354

J. Herrera, D. Rodríguez-Gómez

Publication date: 16 October 2014

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingextremal routing problems

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Applications of optimal control and differential games (49N90) Dynamic programming (90C39)

Related Items (4)

Route problem with constraints depending on a list of tasks ⋮ OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS ⋮ Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ A discrete-continuous routing problem with precedence constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On an iterative procedure for solving a routing problem with constraints
• On a bottleneck routing problem
• Extremal bottleneck routing problem with constraints in the form of precedence conditions
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• An extremal constrained routing problem with internal losses
• Problem of optimal choice of a route under conditions of time discounting
• A generalized Courier problem with the cost function depending on the list of tasks
• On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
• Extremal routing problem with internal losses
• A Dynamic Programming Approach to Sequencing Problems

This page was built for publication: Elements of dynamic programming in extremal routing problems