scientific article; zbMATH DE number 3152615
From MaRDI portal
Publication:3270185
zbMATH Open0093.31902MaRDI QIDQ3270185FDOQ3270185
Authors: Guy de Ghellinck
Publication date: 1960
Title of this publication is not available (Why is that?)
Cited In (13)
- Deterministic discrete dynamic programming with discount factor greater than one: Some further results and algorithms
- Solving stochastic dynamic programming problems by linear programming — An annotated bibliography
- Singularly perturbed linear programs and Markov decision processes
- Survey of linear programming for standard and nonstandard Markovian control problems. Part I: Theory
- Derman's book as inspiration: some results on LP for MDPs
- Computational aspects in applied stochastic control
- Randomized linear programming solves the Markov decision problem in nearly linear (sometimes sublinear) time
- The simplex method is strongly polynomial for deterministic Markov decision processes
- Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks
- Title not available (Why is that?)
- On the block upper-triangularity of undiscounted multi-chain Markov decision problems
- Linear programming with multiple choice constraints for single chain undiscounted Markov decision problems
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3270185)