Abstract
In this article we extend classical deterministic control problems towards stochastic networks. A certain class of such stochastic discrete control problems with finite time horizon is introduced. Algorithms for solving the considered class of problems via the theory of Markov processes and dynamic programming are proposed. We apply the time-expanded network method and present complexity results of the constructive algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
