A MODIFICATION OF THE DYNAMIC-PROGRAMMING METHOD FOR THE TRAVELING-SALESMAN PROBLEM / KOROTAYEVA LN,SESEKIN AN,CHENTSOV AG // USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS. - 1989. - V. 29, l. 4. - P. 96-100.

ISSN/EISSN:

0041-5553 / нет данных

Type:

Article

Abstract:

A time-optimal control problem is considered for a simple trajectory visiting a given finite system of goal sets. The Bellman function is constructed and a recursive evaluation algorithm is developed. Numerical implementation examples are presented.

Author keywords:

нет данных

DOI:

10.1016/0041-5553(89)90123-7

Web of Science ID:

ISI:A1989FE71600015

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

—

Другие поля

Поле	Значение
Publisher	PERGAMON-ELSEVIER SCIENCE LTD
Address	THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD, ENGLAND OX5 1GB
Language	English
Research-Areas	Mathematics
Web-of-Science-Categories	Mathematics, Applied
ORCID-Numbers	Sesekin, Alexander/0000-0002-1339-9044
Number-of-Cited-References	2
Usage-Count-Since-2013	2
Doc-Delivery-Number	FE716