Dynamic programming in the routing problem with complex dependence of costs on the list of jobs

DOI10.1134/S1064230714020051zbMath1311.49100OpenAlexW2084214598MaRDI QIDQ2263886

Yanyan Li

Publication date: 19 March 2015

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

Full work available at URL: https://doi.org/10.1134/s1064230714020051

zbMATH Keywords

dynamic programmingrouting problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic programming method in extremal constrained routing problems
• Constrained optimal routing
• 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
• A generalized Courier problem with the cost function depending on the list of tasks
• Dynamic Programming Treatment of the Travelling Salesman Problem

This page was built for publication: Dynamic programming in the routing problem with complex dependence of costs on the list of jobs