|
Avtomatika i Telemekhanika, 2006, Issue 7, Pages 27–40
(Mi at1206)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Deterministic Systems
Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem
S. I. Sergeev Moscow State University of Economics, Statistics and Informatics
Abstract:
For one of the basic variants of the dynamic minisum traveling salesman problem, a decomposition scheme is designed, which in general gives a new approximate solution algorithm. This algorithm is exact if certain conditions are imposed on the distance matrix. The problem is solved with the sufficient optimality conditions known in optimal control theory.
Citation:
S. I. Sergeev, “Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem”, Avtomat. i Telemekh., 2006, no. 7, 27–40; Autom. Remote Control, 67:7 (2006), 1039–1050
Linking options:
https://www.mathnet.ru/eng/at1206 https://www.mathnet.ru/eng/at/y2006/i7/p27
|
Statistics & downloads: |
Abstract page: | 256 | Full-text PDF : | 98 | References: | 43 | First page: | 1 |
|