Algorithms for solving discrete optimal control problems with infinite time horizon and determining minimal mean cost cycles in a directed graph as decision support tool (Q623763)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for solving discrete optimal control problems with infinite time horizon and determining minimal mean cost cycles in a directed graph as decision support tool |
scientific article; zbMATH DE number 5847858
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for solving discrete optimal control problems with infinite time horizon and determining minimal mean cost cycles in a directed graph as decision support tool |
scientific article; zbMATH DE number 5847858 |
Statements
Algorithms for solving discrete optimal control problems with infinite time horizon and determining minimal mean cost cycles in a directed graph as decision support tool (English)
0 references
8 February 2011
0 references
time-discrete system
0 references
discrete control with infinite time horizon
0 references
stationary control
0 references
minimal mean cost cycle in a digraph
0 references
environmental decision problem
0 references
0 references
0 references
