Relaxations of Weakly Coupled Stochastic Dynamic Programs
From MaRDI portal
Publication:3392203
Recommendations
- Information Relaxations, Duality, and Convex Stochastic Dynamic Programs
- Approximations to stochastic dynamic programs via information relaxation duality
- Information relaxations and duality in stochastic dynamic programs
- The Linear Programming Approach to Approximate Dynamic Programming
- Approximate Dynamic Programming via a Smoothed Linear Program
Cited in
(33)- Resource-constrained management of heterogeneous assets with stochastic deterioration
- Approximate policy iteration for dynamic resource-constrained project scheduling
- Lagrangian relaxation and constraint generation for allocation and advanced scheduling
- A novel decomposition-based method for solving general-product structure assemble-to-order systems
- A survey on skill-based routing with applications to service operations management
- Identifying proactive ICU patient admission, transfer and diversion policies in a public-private hospital network
- Dynamic multi-appointment patient scheduling for radiation therapy
- Epiconvergence of relaxed stochastic optimization problems
- Computational bounds for elevator control policies by large scale linear programming
- Reductions of approximate linear programs for network revenue management
- On a piecewise-linear approximation for network revenue management
- Information Relaxations, Duality, and Convex Stochastic Dynamic Programs
- Balancing exploitation and exploration in discrete optimization via simulation through a Gaussian process-based search
- Decomposable Markov decision processes: A fluid optimization approach
- Robust decomposable Markov decision processes motivated by allocating school budgets
- Multi-class, multi-resource advance scheduling with no-shows, cancellations and overbooking
- Initial shipment decisions for new products at Zara
- On bid-price controls for network revenue management
- A duality-based relaxation and decomposition approach for inventory distribution systems
- Information relaxation bounds for infinite horizon Markov decision processes
- A data efficient and feasible level set method for stochastic convex optimization with expectation constraints
- Asymptotically optimal Lagrangian policies for multi-warehouse, multi-store systems with lost sales
- Dynamic programs with shared resources and signals: dynamic fluid policies and asymptotic optimality
- Approximations to stochastic dynamic programs via information relaxation duality
- Prioritizing hepatitis C treatment in U.S. prisons
- Group maintenance: a restless bandits approach
- An Approximation Approach for Response-Adaptive Clinical Trial Design
- Constrained multiagent Markov decision processes: a taxonomy of problems and algorithms
- Opaque selling of multiple substitutable products with finite inventories
- Technical Note—On the Strength of Relaxations of Weakly Coupled Stochastic Dynamic Programs
- Percentile optimization in multi-armed bandit problems
- Index policies for campaign promotion strategies in reward-based crowdfunding
- Approximate Linear programming for a queueing control problem
This page was built for publication: Relaxations of Weakly Coupled Stochastic Dynamic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392203)
