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

This paper deals with the following problem on a plane. There are \(N\geq 2\) subsets \(M_1, M_2,\dots, M_N\) and a point \(x_0.\) The goal is to find a path \(x_0,x_1,\dots ,x_N\) with the minimal length and such that \(x_n\in M_N\), \(n=1,\dots,N.\) The authors derive the optimality equation for this problems and investigates the errors when inexact calculations take place.