RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive

Avtomat. i Telemekh., 2012 Issue 3, Pages 134–149 (Mi at3783)

This article is cited in 23 papers

Applications of Mathematical Programming

On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs

A. G. Chentsov

Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg, Russia

Abstract: Consideration was given to a scheme for solving the extremal routing problem constrained by the precedence conditions and based on a modification of the dynamic programming method. Attention was focused on an issue related with parallelization of the procedure of constructing the Bellman function layers. A hypothetical construction for distribution of the space of positions between the processors such that they can run without any data exchange until the final stage of computations was proposed.

Presented by the member of Editorial Board: A. I. Kibzun

Received: 06.06.2011


 English version:
Automation and Remote Control, 2012, 73:3, 532–546

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026