Pages that link to "Item:Q3637395"
From MaRDI portal
The following pages link to The Linear Programming Approach to Approximate Dynamic Programming (Q3637395):
Displaying 50 items.
- Smoothing and parametric rules for stochastic mean-CVaR optimal execution strategy (Q285995) (← links)
- Approximate dynamic programming for stochastic linear control problems on compact state spaces (Q299794) (← links)
- On the computational complexity and generalization properties of multi-stage and stage-wise coupled scenario programs (Q313286) (← links)
- Approximate linear programming for networks: average cost bounds (Q342031) (← links)
- Network revenue management with inventory-sensitive bid prices and customer choice (Q421775) (← links)
- A framework and a mean-field algorithm for the local control of spatial processes (Q433494) (← links)
- Approximate dynamic programming for capacity allocation in the service industry (Q439484) (← links)
- Convergence rates of moment-sum-of-squares hierarchies for optimal control problems (Q511733) (← links)
- A variable neighborhood search based algorithm for finite-horizon Markov decision processes (Q613296) (← links)
- Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming (Q633553) (← links)
- Stochastic control via direct comparison (Q633815) (← links)
- Practical solution techniques for first-order MDPs (Q835833) (← links)
- A new learning algorithm for optimal stopping (Q839001) (← links)
- Symmetric approximate linear programming for factored MDPs with application to constrained problems (Q870814) (← links)
- A perspective-based convex relaxation for switched-affine optimal control (Q893481) (← links)
- Partially observable Markov decision process approximations for adaptive sensing (Q977009) (← links)
- A dynamic programming extension to the steady state refinery-LP (Q1014942) (← links)
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands (Q1027533) (← links)
- Ambiguous partially observable Markov decision processes: structural results and applications (Q1622437) (← links)
- Relationship between least squares Monte Carlo and approximate linear programming (Q1728294) (← links)
- Linear programming formulation for non-stationary, finite-horizon Markov decision process models (Q1728357) (← links)
- Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
- Shape constraints in economics and operations research (Q1730901) (← links)
- An approximate dynamic programming approach for sequential pig marketing decisions at herd level (Q1734355) (← 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 linear programming methodology for approximate dynamic programming (Q2023646) (← links)
- A dynamic programming framework for optimal delivery time slot pricing (Q2030595) (← links)
- Exploiting bounded rationality in risk-based cyber camouflage games (Q2056937) (← links)
- Gradient-bounded dynamic programming for submodular and concave extensible value functions with probabilistic performance guarantees (Q2059319) (← links)
- Data-driven optimal control with a relaxed linear program (Q2063818) (← links)
- Transmission scheduling for multi-process multi-sensor remote estimation via approximate dynamic programming (Q2063834) (← links)
- Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
- Dynamic node packing (Q2097666) (← links)
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
- Dynamic multi-appointment patient scheduling for radiation therapy (Q2253376) (← links)
- Randomized methods for design of uncertain systems: sample complexity and sequential algorithms (Q2342767) (← links)
- Large-scale unit commitment under uncertainty (Q2351161) (← links)
- Accelerated modified policy iteration algorithms for Markov decision processes (Q2391867) (← links)
- Computational bounds for elevator control policies by large scale linear programming (Q2441574) (← links)
- Dynamic programming and suboptimal control: a survey from ADP to MPC (Q2511993) (← links)
- Partially observable multistage stochastic programming (Q2661508) (← links)
- Viability, viscosity, and storage functions in model-predictive control with terminal constraints (Q2665391) (← links)
- Reductions of Approximate Linear Programs for Network Revenue Management (Q2797458) (← links)
- Linear Programming and the Control of Diffusion Processes (Q2802245) (← links)
- An AO<sup>*</sup> Based Exact Algorithm for the Canadian Traveler Problem (Q2806869) (← links)
- An iterative approach to the optimal co-design of linear control systems (Q2807885) (← links)
- Computing Near-Optimal Policies in Generalized Joint Replenishment (Q2815435) (← links)
- Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q2817835) (← links)
- Decomposable Markov Decision Processes: A Fluid Optimization Approach (Q2957475) (← links)
