Reduction of route optimization problems / Chentsov AA,Chentsov AG // AUTOMATION AND REMOTE CONTROL. - 2000. - V. 61, l. 10, 2. - P. 1708-1722.

ISSN/EISSN:

0005-1179 / нет данных

Type:

Article

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 keywords:

нет данных

DOI:

нет данных

Web of Science ID:

ISI:000165336800005

Соавторы в МНС:

—

Другие поля

Поле	Значение
Month	OCT
Publisher	MAIK NAUKA/INTERPERIODICA/SPRINGER
Address	233 SPRING ST, NEW YORK, NY 10013-1578 USA
Language	English
Research-Areas	Automation \& Control Systems; Instruments \& Instrumentation
Web-of-Science-Categories	Automation \& Control Systems; Instruments \& Instrumentation
Number-of-Cited-References	18
Usage-Count-Since-2013	4
Journal-ISO	Autom. Remote Control
Doc-Delivery-Number	374GE