Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games
- 1 January 1994
- journal article
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 29 (5) , 754-759
- https://doi.org/10.1007/bf01125805
Abstract
No abstract availableKeywords
This publication has 0 references indexed in Scilit: