A dynamic programming approach for a class of robust optimization problems
From MaRDI portal
Recommendations
- A dynamic programming approach to adjustable robust optimization
- The dynamic programming approach to multi-model robust optimization
- Robust optimizers for nonlinear programming in approximate dynamic programming
- An efficient algorithm for a certain class of robust optimization problems
- A Robust Optimization Perspective on Stochastic Programming
- scientific article; zbMATH DE number 6843801
- Continuous-time robust dynamic programming
- Robust Stochastic Approximation Approach to Stochastic Programming
- Robust Dual Dynamic Programming
Cites work
- A polynomial time algorithm for convex cost lot-sizing problems
- A robust approach to the chance-constrained knapsack problem
- Computing robust basestock levels
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Deriving robust counterparts of nonlinear uncertain inequalities
- Exact solution of the robust knapsack problem
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Geometric algorithms and combinatorial optimization.
- Layered Formulation for the Robust Vehicle Routing Problem with Time Windows
- Recent advances in robust optimization: an overview
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Robust combinatorial optimization with variable budgeted uncertainty
- Robust combinatorial optimization with variable cost uncertainty
- Robust constrained shortest path problems under budgeted uncertainty
- Robust convex optimization
- Robust counterparts of inequalities containing sums of maxima of linear functions
- Robust discrete optimization and network flows
- Robust network design with uncertain outsourcing cost
- Robust optimization
- Robust optimization of sums of piecewise linear functions with application to inventory problems
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Some APX-completeness results for cubic graphs
- Supermodularity and affine policies in dynamic robust optimization
- Technical note: Deriving robust and globalized robust solutions of uncertain linear programs with general convex uncertainty sets
- The Price of Robustness
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem
- The robust vehicle routing problem with time windows
- Theory and applications of robust optimization
Cited in
(20)- Robust inventory theory with perishable products
- A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty
- Adaptive robust optimization for lot-sizing under yield uncertainty
- A perfect information lower bound for robust lot-sizing problems
- A survey of decision making and optimization under uncertainty
- The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
- Robust formulations for economic lot-sizing problem with remanufacturing
- Supermodularity and affine policies in dynamic robust optimization
- Robust optimization for lot-sizing problems under yield uncertainty
- A dynamic programming approach to adjustable robust optimization
- Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
- Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions
- Comparison of different approaches to multistage lot sizing with uncertain demand
- Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty
- Dynamic lot sizing with stochastic demand timing
- Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem
- Robust Dual Dynamic Programming
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- Robust inventory problem with budgeted cumulative demand uncertainty
- Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations
This page was built for publication: A dynamic programming approach for a class of robust optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817842)
