𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Shortest Route Methods for Finite State Space Deterministic Dynamic Programming Problems

✍ Scribed by Jeremy F. Shapiro

Book ID
124874239
Publisher
Society for Industrial and Applied Mathematics
Year
1968
Tongue
English
Weight
454 KB
Volume
16
Category
Article
ISSN
0036-1399

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

State space partitioning methods for sto
State space partitioning methods for stochastic shortest path problems
✍ Alexopoulos, Christos πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 150 KB πŸ‘ 2 views

This paper describes methods for computing measures related to shortest paths in networks with discrete random arc lengths. These measures include the probability that there exists a path with length not exceeding a specified value and the probability that a given path is shortest. The proposed meth

[Lecture Notes in Computer Science] Comb
[Lecture Notes in Computer Science] Combinatorial Optimization Volume 8596 || State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting
✍ Fouilhoux, Pierre; Gouveia, Luis Eduardo Neves; Mahjoub, A. Ridha; Paschos, Vang πŸ“‚ Article πŸ“… 2014 πŸ› Springer International Publishing 🌐 German βš– 222 KB

This book constitutes the thoroughly refereed post-conference proceedings of the Third International Symposium on Combinatorial Optimization, ISCO 2014, held in Lisbon, Portugal, in March 2014. The 37 revised full papers presented together with 64 short papers were carefully reviewed and selected fr