R. Bellman and R. Kalaba. On kth best policies. SIAM Journal of Computing, 8, 1960, pages 582--588. 110 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Algorithm for Efficient Computation of K Shortest Paths - Jimenez, Marzal (1994) (1 citation) (Correct)
....1 the Bellman Ford algorithm, an iterative procedure requiring O(jV j Delta jEj) time [Bell58] In what follows we will denote by A the asymptotic time complexity of computing the shortest path from s to all nodes in V . Bellman and Kalaba generalized the Bellman equations for the case K = 2 [BK60]. The algorithm proposed by these authors consisted of first finding the shortest path from s to all other nodes and, then, of computing their respective second shortest paths by an iterative procedure similar to the Bellman Ford algorithm. Dreyfus [Drey69] extended the Bellman Kalaba equations to ....
R. Bellman and R. Kalaba: "On kth Best Policies", Journal of the Society of Industrial and Applied Mathematics, 8, no. 4, pp. 582--588. (1960)
On Enumeration of Near to Best Solutions in Discrete and.. - Joseph V. Romanovsky (1993) (Correct)
....after optimum is a natural generalization of an ordinary extremal problem in the case when the set of feasible solutions is discrete. The first algorithms of that kind were considered yet by W. Hoffman and R. Pavley [1] and by R. Bellman and R. Kalaba at the very beginning of dynamic programming [2]. The greatest interest was paid to this approach in connection with the problem of the shortest path in a graph [3, 4, 5, 6, 7] and this interest is yet al..ive as it follows from the recent discussion in electronic conferences. The discussion gave some new titles in this field, unfortunately I ....
Bellman, R., Kalaba, R. On kth best policies, Journ. of SIAM, 1960, 8, 399--404. -- 20 --
A Survey of Sequential and Systolic Algorithms for the Algebraic.. - Fink (1992) (4 citations) (Correct)
No context found.
R. Bellman and R. Kalaba. On kth best policies. SIAM Journal of Computing, 8, 1960, pages 582--588. 110
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC