Dynamic programming in the routing problem with constraints and costs depending on a list of tasks

DOI10.1134/S1064562413060021zbMath1300.90035OpenAlexW2013807699MaRDI QIDQ403862

J. Herrera, H. S. Yoon

Publication date: 29 August 2014

Published in: Doklady Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

traveling salesman problemarrival and departure points

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items

Route problem with constraints depending on a list of tasks, Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints, An exact algorithm with linear complexity for a problem of visiting megalopolises, On the question of the optimization of permutations in the problem with dynamic constraints, Routing under constraints: problem of visit to megalopolises, A discrete-continuous routing problem with precedence constraints, Optimizing insertions in a constraint routing problem with complicated cost functions

Cites Work

• Unnamed Item
• Dynamic programming method in extremal constrained routing problems
• Iteration method in a routing problem with internal losses
• Dynamic programming method in the generalized courier problem
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• 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