Pages that link to "Item:Q4233514"
From MaRDI portal
The following pages link to SPLINE APPROXIMATIONS TO VALUE FUNCTIONS (Q4233514):
Displaying 16 items.
- Error estimation and adaptive discretization for the discrete stochastic Hamilton-Jacobi-Bellman equation (Q706233) (← links)
- Using dynamic programming with adaptive grid scheme for optimal control problems in economics (Q953726) (← links)
- Optimal time aggregation of infinite horizon control problems (Q956518) (← links)
- Relationship between least squares Monte Carlo and approximate linear programming (Q1728294) (← links)
- A polyhedral approach to online bipartite matching (Q1801015) (← links)
- State partitioning based linear program for stochastic dynamic programs: an invariance property (Q1939695) (← links)
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
- Dynamic programming with Hermite approximation (Q2354012) (← links)
- Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379) (← links)
- Adaptive spline interpolation for Hamilton-Jacobi-Bellman equations (Q2497779) (← links)
- Asset pricing with dynamic programming (Q2642596) (← links)
- Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q2817835) (← links)
- A Polyhedral Approach to Online Bipartite Matching (Q3186510) (← links)
- Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q4646440) (← links)
- Policy iteration accelerated with Krylov methods (Q5958353) (← links)
- Reductions of non-separable approximate linear programs for network revenue management (Q6167751) (← links)