Year: 2000
Type: article
Abstract: We developed the tchniques for immediate solution and optimization by parts for discrete nonlinear separable programming problem on the graph. These two techniques are based on the use of the dynamic programming method that results in obtaining one algorithm of dynamic programming built into another one. The both techniques make use of the graph structure. Multiple use of the decomposition is generalized in the frames of the hierarchically recurrent algorithm of dynamic programming.
Source: Ciência e Natura
Author: Aleksander Alekseievitch Tsoi
Institution: Universidade de Passo Fundo
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2809015777