Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations.
From MaRDI portal
Publication:5936764
DOI10.1016/S0895-7177(00)00282-XzbMath1041.90064MaRDI QIDQ5936764
No author found.
Publication date: 8 July 2001
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
90C35: Programming involving graphs or networks
49L20: Dynamic programming in optimal control and differential games
90C39: Dynamic programming
Related Items
Cluster-level operations planning for the out-of-position robotic arc-welding, A discrete-continuous routing problem with precedence constraints, An extremal constrained routing problem with internal losses, 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