Graphs, dynamic programming, and finite games
From MaRDI portal
Cited in
(16)- Connectability and structural controllability of composite systems
- A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal
- Graph nodes and a definition of structural similarity
- A STUDY ON SEQUENTIAL DECISION PROCESS
- Optimale Reservepolitik als Markoffscher Entscheidungsproze\
- Gambling and curve fitting problems using dynamic programming
- Richard Bellman's contributions to computer science
- COMPLETION TIMES IN NETWORKS—THE THEORY OF RELATIVELY CLOSED SYSTEMS APPLIED TO MAXIMUM OPERATORS
- Infinite versions of some problems from finite complexity theory
- Gambling and curve fitting problems using dynamic programming
- An influence matrix for project expediting
- Optimization of costly measurements in stochastic decision processes
- On the difficulty of finding walks of length k
- On enumerating paths of K arcs in unoriented complete graphs
- An approximation method for solving the sofa problem
- Nearest route problem
This page was built for publication: Graphs, dynamic programming, and finite games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2528344)
