Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations. (Q5936764): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0895-7177(00)00282-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1972411887 / rank | |||
Normal rank | |||
Latest revision as of 10:22, 30 July 2024
scientific article; zbMATH DE number 1614931
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations. |
scientific article; zbMATH DE number 1614931 |
Statements
Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations. (English)
0 references
8 July 2001
0 references
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.
0 references
Generalized traveling salesman problem
0 references
dynamic programming
0 references
inexact calculations
0 references
