Dynamic programming method in the generalized courier problem

DOI10.1134/S1064230708030167zbMath1198.90383MaRDI QIDQ733995

D. Kharzeev

Publication date: 19 October 2009

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

zbMATH Keywords

dynamic programmingoptimal solutionBellman functioncourier problemPC memorytravel costs

Mathematics Subject Classification ID

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

Related Items (4)

Dynamic programming method in extremal constrained routing problems ⋮ An approach to solution of the movements routing problem with several participants ⋮ Dynamic programming in the routing problem with constraints and costs depending on a list of tasks ⋮ A generalized Courier problem with the cost function depending on the list of tasks

Cites Work

• Unnamed Item
• Extremal bottleneck routing problem with constraints in the form of precedence conditions
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. II: Exact methods
• The iterations method in generalized courier problem with singularity in the definition of cost functions

This page was built for publication: Dynamic programming method in the generalized courier problem