Graphs, dynamic programming, and finite games
From MaRDI portal
Publication:2528344
zbMath0161.39201MaRDI QIDQ2528344
Publication date: 1967
Published in: Mathematics in Science and Engineering (Search for Journal in Brave)
Related Items
Richard Bellman's contributions to computer science ⋮ A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal ⋮ A STUDY ON SEQUENTIAL DECISION PROCESS ⋮ Graph nodes and a definition of structural similarity ⋮ Infinite versions of some problems from finite complexity theory ⋮ An approximation method for solving the sofa problem ⋮ Optimale Reservepolitik als Markoffscher Entscheidungsproze\ ⋮ An influence matrix for project expediting ⋮ Optimization of costly measurements in stochastic decision processes ⋮ On the difficulty of finding walks of length k ⋮ COMPLETION TIMES IN NETWORKS—THE THEORY OF RELATIVELY CLOSED SYSTEMS APPLIED TO MAXIMUM OPERATORS ⋮ On enumerating paths of K arcs in unoriented complete graphs ⋮ Connectability and structural controllability of composite systems ⋮ Gambling and curve fitting problems using dynamic programming ⋮ Gambling and curve fitting problems using dynamic programming ⋮ Nearest route problem