Finite Adaptability in Multistage Linear Optimization
From MaRDI portal
Publication:4979027
DOI10.1109/TAC.2010.2049764zbMath1368.90100OpenAlexW2043366665MaRDI QIDQ4979027
Constantine Caramanis, Dimitris J. Bertsimas
Publication date: 25 August 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.2010.2049764
Related Items (58)
Robust and reliable portfolio optimization formulation of a chance constrained problem ⋮ Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization ⋮ ROC++: Robust Optimization in C++ ⋮ Piecewise static policies for two-stage adjustable robust linear optimization ⋮ K-Adaptability in Two-Stage Robust Binary Programming ⋮ Frameworks and results in distributionally robust optimization ⋮ Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty ⋮ Optimization under Decision-Dependent Uncertainty ⋮ Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints ⋮ A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set ⋮ Robust Models for the Kidney Exchange Problem ⋮ Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems ⋮ On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty ⋮ Multistage robust discrete optimization via quantified integer programming ⋮ Min-Max-Min Optimization with Smooth and Strongly Convex Objectives ⋮ Adjustable robust optimization with objective uncertainty ⋮ Robust decision trees for the multi-mode project scheduling problem with a resource investment objective and uncertain activity duration ⋮ A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization ⋮ A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty ⋮ \(K\)-adaptability in two-stage mixed-integer robust optimization ⋮ Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty ⋮ A double-oracle, logic-based Benders decomposition approach to solve the \(K\)-adaptability problem ⋮ A framework for inherently interpretable optimization models ⋮ Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints ⋮ Binary decision rules for multistage adaptive mixed-integer optimization ⋮ A constraint sampling approach for multi-stage robust optimization ⋮ Robust post-disaster route restoration ⋮ A Primal–Dual Lifting Scheme for Two-Stage Robust Optimization ⋮ A comparison of routing sets for robust network design ⋮ Multipolar robust optimization ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ A survey of adjustable robust optimization ⋮ \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty ⋮ \(k\)-adaptive routing for the robust network loading problem ⋮ Dominance-based linear formulation for the anchor-robust project scheduling problem ⋮ Two-stage robust optimization approach to elective surgery and downstream capacity planning ⋮ Min-max-min robust combinatorial optimization ⋮ Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard ⋮ The decision rule approach to optimization under uncertainty: methodology and applications ⋮ Oracle-based algorithms for binary two-stage robust optimization ⋮ $K$-adaptability in two-stage distributionally robust binary programming ⋮ Exact lexicographic scheduling and approximate rescheduling ⋮ Decomposition for adjustable robust linear optimization subject to uncertainty polytope ⋮ A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches ⋮ Adjustable Robust Optimization via Fourier–Motzkin Elimination ⋮ Relative Robust and Adaptive Optimization ⋮ Approximate and robust bounded job start scheduling for Royal Mail delivery offices ⋮ Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty ⋮ Multistage Robust Mixed-Integer Optimization with Adaptive Partitions ⋮ Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds ⋮ Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set ⋮ Optimizing subscriber migrations for a telecommunication operator in uncertain context ⋮ Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty ⋮ Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios ⋮ Piecewise Constant Decision Rules via Branch-and-Bound Based Scenario Detection for Integer Adjustable Robust Optimization ⋮ \(K\)-adaptability in stochastic optimization ⋮ A Lagrangian dual method for two-stage robust optimization with binary uncertainties ⋮ Technical Note—Two-Stage Sample Robust Optimization
This page was built for publication: Finite Adaptability in Multistage Linear Optimization
