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

10Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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. © 2001 Elsevier Science Ltd.

Cite

CITATION STYLE

APA

Chentsov, A. A., & Chentsov, A. G. (2001). Dynamic programming method in the generalized traveling salesman problem: The influence of inexact calculations. Mathematical and Computer Modelling, 33(8–9), 801–819. https://doi.org/10.1016/S0895-7177(00)00282-X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free