Standard

Reduction of route optimization problems. / Chentsov, A. A.; Chentsov, A. G.
в: Automation and Remote Control, Том 61, № 10. Part 2, 2000, стр. 1708-1722.

Результаты исследований: Вклад в журнал › Статья › Рецензирование

Harvard

Chentsov, AA & Chentsov, AG 2000, 'Reduction of route optimization problems', Automation and Remote Control, Том. 61, № 10. Part 2, стр. 1708-1722.

APA

Chentsov, A. A., & Chentsov, A. G. (2000). Reduction of route optimization problems. Automation and Remote Control, 61(10. Part 2), 1708-1722.

Vancouver

Chentsov AA, Chentsov AG. Reduction of route optimization problems. Automation and Remote Control. 2000;61(10. Part 2):1708-1722.

Author

Chentsov, A. A. ; Chentsov, A. G. / Reduction of route optimization problems. в: Automation and Remote Control. 2000 ; Том 61, № 10. Part 2. стр. 1708-1722.

BibTeX

@article{a81a18b59e6f47cfa9917bd40b06fdfc,
title = "Reduction of route optimization problems",
abstract = "Sequential reaching of a finite system of sets with an additive cost aggregation function is studied. The representation of the extremum for the travelling salesman problem when the {"}cities{"} vary within the limits of sets is investigated. For displacement costs defined by a seminorm, the work domain of the dynamic programming method is reduced through the substitution of the initial set of boundaries, which in concrete problems is discretized. Worsening of the extremum is estimated by the sum of Hausdorff deviations. A model example is given.",
author = "Chentsov, {A. A.} and Chentsov, {A. G.}",
year = "2000",
language = "English",
volume = "61",
pages = "1708--1722",
journal = "Automation and Remote Control",
issn = "0005-1179",
publisher = "Maik Nauka-Interperiodica Publishing",
number = "10. Part 2",

}

RIS

TY - JOUR

T1 - Reduction of route optimization problems

AU - Chentsov, A. A.

AU - Chentsov, A. G.

PY - 2000

Y1 - 2000

N2 - Sequential reaching of a finite system of sets with an additive cost aggregation function is studied. The representation of the extremum for the travelling salesman problem when the "cities" vary within the limits of sets is investigated. For displacement costs defined by a seminorm, the work domain of the dynamic programming method is reduced through the substitution of the initial set of boundaries, which in concrete problems is discretized. Worsening of the extremum is estimated by the sum of Hausdorff deviations. A model example is given.

AB - Sequential reaching of a finite system of sets with an additive cost aggregation function is studied. The representation of the extremum for the travelling salesman problem when the "cities" vary within the limits of sets is investigated. For displacement costs defined by a seminorm, the work domain of the dynamic programming method is reduced through the substitution of the initial set of boundaries, which in concrete problems is discretized. Worsening of the extremum is estimated by the sum of Hausdorff deviations. A model example is given.

UR - https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=tsmetrics&SrcApp=tsm_test&DestApp=WOS_CPL&DestLinkType=FullRecord&KeyUT=000165336800005

M3 - Article

VL - 61

SP - 1708

EP - 1722

JO - Automation and Remote Control

JF - Automation and Remote Control

SN - 0005-1179

IS - 10. Part 2

ER -

ID: 42725898