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

Authors
Chentsov, AA Chentsov, AG
Citation
Aa. Chentsov et Ag. Chentsov, Dynamic programming method in the generalized traveling salesman problem: The influence of inexact calculations, MATH COMP M, 33(8-9), 2001, pp. 801-819
Citations number
17
Categorie Soggetti
Engineering Mathematics
Journal title
MATHEMATICAL AND COMPUTER MODELLING
ISSN journal
08957177 → ACNP
Volume
33
Issue
8-9
Year of publication
2001
Pages
801 - 819
Database
ISI
SICI code
0895-7177(200104/05)33:8-9<801:DPMITG>2.0.ZU;2-L
Abstract
For the generalized traveling salesman problem, the known dynamic programmi ng method (DPM) under conditions of inexact calculations of the Bellman fun ction is investigated. Concrete estimates of the errors under the realizati on 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. (C) 2001 Elsevier Science Ltd. All rights re served.