Onkth Best Policies

DOI10.1137/0108044zbMath0096.34304OpenAlexW2023132252MaRDI QIDQ3275308

Richard Bellman, Robert E. Kalaba

Publication date: 1961

Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0108044

zbMATH Keywords

statistics

Related Items (9)

Richard Bellman's contributions to computer science ⋮ k-th shortest collision-free path planning ⋮ Solutions of the kth best route through a network. A review ⋮ Routing through a network with maximum reliability ⋮ A combinatorial ranking problem ⋮ The multiple shortest path problem with path deconfliction ⋮ Generalization of the dynamic programming scheme ⋮ Two-best solutions under distance constraints: The model and exemplary results for matroids ⋮ A dynamic programming algorithm to find all solutions in a neighborhood of the optimum

This page was built for publication: Onkth Best Policies