Solving the routing optimization problem using the dynamic programming method / Chentsov AA,Chentsov AG // JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL. - 1999. - V. 38, l. 3. - P. 409-420.

ISSN/EISSN:

1064-2307 / нет данных

Type:

Article

Abstract:

The present paper studies the effect of inexact computations on the effectiveness of the routing version of dynamic programming in the problem of bypassing sections of multivalued mappings. We study a specific definition of the general routing procedure in the bypass problem for substantially nonstationary performance indices and ``reachability domains{''} when the sequential motion in the space of problems along the paths that are formed in conformity with the route being realized under conditions of several possible passages from the solution of one problem to the solution of the other. The methods thus developed can be applied to the problems of freight transportation and of locating radio equipment components on printed circuit boards, etc.

Author keywords:

нет данных

DOI:

нет данных

Web of Science ID:

ISI:000080779800010

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

—

Другие поля

Поле	Значение
Month	MAY-JUN
Publisher	INTERPERIODICA
Address	PO BOX 1831, BIRMINGHAM, AL 35201-1831 USA
Language	English
Research-Areas	Computer Science
Web-of-Science-Categories	Computer Science, Artificial Intelligence; Computer Science, Cybernetics; Computer Science, Theory \& Methods
Number-of-Cited-References	13
Usage-Count-Since-2013	4
Journal-ISO	J. Comput. Syst. Sci. Int.
Doc-Delivery-Number	204TG