Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations.

DOI10.1016/S0895-7177(00)00282-XzbMath1041.90064OpenAlexW1972411887MaRDI QIDQ5936764

No author found.

Publication date: 8 July 2001

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(00)00282-x

zbMATH Keywords

dynamic programmingGeneralized traveling salesman probleminexact calculations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming in optimal control and differential games (49L20) Dynamic programming (90C39)

Related Items (4)

An extremal constrained routing problem with internal losses ⋮ A discrete-continuous routing problem with precedence constraints ⋮ Cluster-level operations planning for the out-of-position robotic arc-welding ⋮ Extremal routing problem with internal losses

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the solution of traveling salesman problems
• An assignment problem
• The dynamic programming method in the generalized traveling salesman problem
• A modification of the dynamic programming method for the travelling-salesman problem
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems

This page was built for publication: Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations.