Dynamic programming in the problem of decomposition optimization

Dynamic programming in the problem of decomposition optimization

0.00 Avg rating0 Votes
Article ID: iaor2003773
Country: Netherlands
Volume: 63
Issue: 5
Start Page Number: 815
End Page Number: 828
Publication Date: May 2002
Journal: Automation and Remote Control
Authors: ,
Abstract:

Consideration was given to the ‘operator’ version of the dynamic programming method in the problem of decomposing a nonempty set in the presence of inexact calculations of the Bellman function.

Reviews

Required fields are marked *. Your email address will not be published.