Pages that link to "Item:Q4567182"
From MaRDI portal
The following pages link to A Linearly Relaxed Approximate Linear Program for Markov Decision Processes (Q4567182):
Displaying 6 items.
- Separable Markovian decision problems. The linear programming method in the multichain case (Q1190392) (← links)
- Linear programming formulation for non-stationary, finite-horizon Markov decision process models (Q1728357) (← links)
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds (Q5058054) (← links)
- Modelling and solving resource allocation problems via a dynamic programming approach (Q5157967) (← links)
- A linear programming based approach for composite-action Markov decision processes (Q5214327) (← links)
- Simple and fast algorithm for binary integer and online linear programming (Q6160284) (← links)