Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games (Q1842405)
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: Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games |
scientific article; zbMATH DE number 745981
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games |
scientific article; zbMATH DE number 745981 |
Statements
Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games (English)
0 references
17 May 1995
0 references
minimax paths in networks
0 references
cyclic games
0 references
strongly polynomial algorithm
0 references
optimum stationary strategies
0 references
