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

Authors:
A. A. Chentsov;A. G. Chentsov
Affiliations:
Institute of Mathematics and Mechanics Urals Scientific Center S. Kovalevskaja str., 16, 620066 Ekaterinburg, Russia;Institute of Mathematics and Mechanics Urals Scientific Center S. Kovalevskaja str., 16, 620066 Ekaterinburg, Russia
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2001

Citing 2
Cited 2

Dynamic Programming Treatment of the Travelling Salesman Problem

Journal of the ACM (JACM)
The dynamic programming method in the generalized traveling salesman problem

Mathematical and Computer Modelling: An International Journal

Dynamic Programming in the Problem of Decomposition Optimization

Automation and Remote Control
On Solution of the Problem of Successive Round of Sets by the “Nonclosed” Travelling Salesman Problem

Automation and Remote Control

Quantified Score

Hi-index	0.98

Visualization

Abstract

For the generalized traveling salesman problem, the known dynamic programming method (DPM) under conditions of inexact calculations of the Bellman function is investigated. Concrete estimates of the errors under the realization of the global extremum are obtained. In the scope of the basic problem, the important question about the sequential circuit of the sections of set-valued mappings is considered.