A Dynamic Programming Approach for a Class of Robust Optimization Problems
From MaRDI portal
Publication:2817842
DOI10.1137/15M1007070zbMath1397.90368WikidataQ57736507 ScholiaQ57736507MaRDI QIDQ2817842
Marcio Costa Santos, Michael Poss, Dritan Nace, Agostinho Agra
Publication date: 2 September 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Related Items (14)
Dynamic lot sizing with stochastic demand timing ⋮ Robust inventory theory with perishable products ⋮ Comparison of different approaches to multistage lot sizing with uncertain demand ⋮ Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions ⋮ A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty ⋮ A perfect information lower bound for robust lot-sizing problems ⋮ The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach ⋮ A survey of decision making and optimization under uncertainty ⋮ Robust formulations for economic lot-sizing problem with remanufacturing ⋮ Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty ⋮ Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem ⋮ Robust inventory problem with budgeted cumulative demand uncertainty ⋮ Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations ⋮ Robust optimization for lot-sizing problems under yield uncertainty
Uses Software
Cites Work
- Unnamed Item
- Robust combinatorial optimization with variable cost uncertainty
- Exact solution of the robust knapsack problem
- The robust vehicle routing problem with time windows
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem
- Computing robust basestock levels
- A robust approach to the chance-constrained knapsack problem
- Geometric algorithms and combinatorial optimization.
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Robust discrete optimization and network flows
- Some APX-completeness results for cubic graphs
- A polynomial time algorithm for convex cost lot-sizing problems
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Robust combinatorial optimization with variable budgeted uncertainty
- Robust counterparts of inequalities containing sums of maxima of linear functions
- Recent advances in robust optimization: an overview
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Deriving robust counterparts of nonlinear uncertain inequalities
- Robust Convex Optimization
- Technical Note—Deriving Robust and Globalized Robust Solutions of Uncertain Linear Programs with General Convex Uncertainty Sets
- Theory and Applications of Robust Optimization
- Layered Formulation for the Robust Vehicle Routing Problem with Time Windows
- Robust Network Design with Uncertain Outsourcing Cost
- The Price of Robustness
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Robust constrained shortest path problems under budgeted uncertainty
- Supermodularity and Affine Policies in Dynamic Robust Optimization
- Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems
This page was built for publication: A Dynamic Programming Approach for a Class of Robust Optimization Problems
